./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37db28f3e8ed686c32be65a216c3f55715fa1acd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:13:17,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:13:17,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:13:17,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:13:17,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:13:17,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:13:17,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:13:17,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:13:17,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:13:17,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:13:17,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:13:17,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:13:17,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:13:17,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:13:17,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:13:17,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:13:17,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:13:17,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:13:17,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:13:17,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:13:17,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:13:17,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:13:17,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:13:17,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:13:17,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:13:17,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:13:17,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:13:17,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:13:17,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:13:17,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:13:17,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:13:17,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:13:17,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:13:17,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:13:17,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:13:17,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:13:17,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:13:17,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:13:17,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:13:17,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:13:17,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:13:17,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:13:17,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:13:17,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:13:17,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:13:17,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:13:17,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:13:17,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:13:17,429 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:13:17,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:13:17,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:13:17,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:13:17,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:13:17,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:13:17,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:13:17,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:13:17,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:13:17,431 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:13:17,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:13:17,431 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:13:17,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:13:17,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:13:17,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:13:17,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:13:17,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:13:17,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:13:17,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:13:17,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:13:17,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:13:17,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:13:17,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:13:17,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:13:17,434 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_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/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_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37db28f3e8ed686c32be65a216c3f55715fa1acd [2021-10-13 00:13:17,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:13:17,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:13:17,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:13:17,732 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:13:17,733 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:13:17,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2021-10-13 00:13:17,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/data/1db203bf6/ccd2cd46d18f4d04bf40222406e6b826/FLAG56c5b9486 [2021-10-13 00:13:18,436 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:13:18,436 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2021-10-13 00:13:18,447 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/data/1db203bf6/ccd2cd46d18f4d04bf40222406e6b826/FLAG56c5b9486 [2021-10-13 00:13:18,684 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/data/1db203bf6/ccd2cd46d18f4d04bf40222406e6b826 [2021-10-13 00:13:18,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:13:18,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:13:18,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:13:18,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:13:18,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:13:18,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:13:18" (1/1) ... [2021-10-13 00:13:18,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3e3341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:18, skipping insertion in model container [2021-10-13 00:13:18,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:13:18" (1/1) ... [2021-10-13 00:13:18,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:13:18,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:13:19,141 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_26fec219-bab3-4a4d-acfe-fa38b49e67a5/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2021-10-13 00:13:19,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:13:19,223 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:13:19,285 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_26fec219-bab3-4a4d-acfe-fa38b49e67a5/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2021-10-13 00:13:19,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:13:19,317 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:13:19,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19 WrapperNode [2021-10-13 00:13:19,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:13:19,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:13:19,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:13:19,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:13:19,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:13:19,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:13:19,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:13:19,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:13:19,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:13:19,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:13:19,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:13:19,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:13:19,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (1/1) ... [2021-10-13 00:13:19,478 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:13:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:13:19,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:13:19,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:13:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:13:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:13:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:13:19,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:13:20,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:13:20,711 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 00:13:20,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:13:20 BoogieIcfgContainer [2021-10-13 00:13:20,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:13:20,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:13:20,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:13:20,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:13:20,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:13:18" (1/3) ... [2021-10-13 00:13:20,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2c13fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:13:20, skipping insertion in model container [2021-10-13 00:13:20,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:13:19" (2/3) ... [2021-10-13 00:13:20,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2c13fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:13:20, skipping insertion in model container [2021-10-13 00:13:20,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:13:20" (3/3) ... [2021-10-13 00:13:20,733 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label57.c [2021-10-13 00:13:20,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:13:20,738 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:13:20,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:13:20,810 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=FINITE_AUTOMATA, 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-13 00:13:20,810 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:13:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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-13 00:13:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 00:13:20,839 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:20,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:20,841 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash 560185543, now seen corresponding path program 1 times [2021-10-13 00:13:20,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:20,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406089324] [2021-10-13 00:13:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:20,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:21,209 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-13 00:13:21,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:21,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406089324] [2021-10-13 00:13:21,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406089324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:21,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:21,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:13:21,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702267810] [2021-10-13 00:13:21,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:21,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:21,235 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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) Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-13 00:13:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:21,972 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2021-10-13 00:13:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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) Word has length 78 [2021-10-13 00:13:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:21,988 INFO L225 Difference]: With dead ends: 528 [2021-10-13 00:13:21,988 INFO L226 Difference]: Without dead ends: 266 [2021-10-13 00:13:21,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-13 00:13:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-13 00:13:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 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-13 00:13:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2021-10-13 00:13:22,060 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 78 [2021-10-13 00:13:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:22,062 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2021-10-13 00:13:22,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-13 00:13:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2021-10-13 00:13:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-13 00:13:22,073 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:22,073 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:22,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:13:22,074 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash -723946337, now seen corresponding path program 1 times [2021-10-13 00:13:22,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:22,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133652413] [2021-10-13 00:13:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:22,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:22,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:22,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133652413] [2021-10-13 00:13:22,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133652413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:22,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:22,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:13:22,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449544270] [2021-10-13 00:13:22,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:22,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:22,205 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-13 00:13:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:22,651 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2021-10-13 00:13:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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) Word has length 83 [2021-10-13 00:13:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:22,656 INFO L225 Difference]: With dead ends: 792 [2021-10-13 00:13:22,656 INFO L226 Difference]: Without dead ends: 528 [2021-10-13 00:13:22,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-10-13 00:13:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-10-13 00:13:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3681214421252372) internal successors, (721), 527 states have internal predecessors, (721), 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-13 00:13:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2021-10-13 00:13:22,719 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 83 [2021-10-13 00:13:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:22,719 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2021-10-13 00:13:22,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-13 00:13:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2021-10-13 00:13:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-13 00:13:22,730 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:22,730 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:22,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:13:22,731 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1663817621, now seen corresponding path program 1 times [2021-10-13 00:13:22,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:22,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81709029] [2021-10-13 00:13:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:22,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:22,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:22,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81709029] [2021-10-13 00:13:22,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81709029] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:22,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:22,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:13:22,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270622015] [2021-10-13 00:13:22,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:22,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:22,845 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-13 00:13:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:23,396 INFO L93 Difference]: Finished difference Result 1447 states and 1979 transitions. [2021-10-13 00:13:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:23,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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) Word has length 87 [2021-10-13 00:13:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:23,407 INFO L225 Difference]: With dead ends: 1447 [2021-10-13 00:13:23,407 INFO L226 Difference]: Without dead ends: 921 [2021-10-13 00:13:23,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-10-13 00:13:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2021-10-13 00:13:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3434782608695652) internal successors, (1236), 920 states have internal predecessors, (1236), 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-13 00:13:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1236 transitions. [2021-10-13 00:13:23,440 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1236 transitions. Word has length 87 [2021-10-13 00:13:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:23,441 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1236 transitions. [2021-10-13 00:13:23,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-13 00:13:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1236 transitions. [2021-10-13 00:13:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-13 00:13:23,443 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:23,444 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:23,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:13:23,444 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1322420875, now seen corresponding path program 1 times [2021-10-13 00:13:23,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:23,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813572543] [2021-10-13 00:13:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:23,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:23,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:23,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813572543] [2021-10-13 00:13:23,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813572543] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:23,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:23,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:13:23,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035544139] [2021-10-13 00:13:23,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:23,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:23,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:23,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:23,518 INFO L87 Difference]: Start difference. First operand 921 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-13 00:13:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:23,915 INFO L93 Difference]: Finished difference Result 1840 states and 2470 transitions. [2021-10-13 00:13:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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) Word has length 91 [2021-10-13 00:13:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:23,921 INFO L225 Difference]: With dead ends: 1840 [2021-10-13 00:13:23,921 INFO L226 Difference]: Without dead ends: 921 [2021-10-13 00:13:23,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-10-13 00:13:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2021-10-13 00:13:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3304347826086957) internal successors, (1224), 920 states have internal predecessors, (1224), 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-13 00:13:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1224 transitions. [2021-10-13 00:13:23,962 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1224 transitions. Word has length 91 [2021-10-13 00:13:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:23,963 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1224 transitions. [2021-10-13 00:13:23,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-13 00:13:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1224 transitions. [2021-10-13 00:13:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 00:13:23,968 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:23,968 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:23,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:13:23,971 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1157037562, now seen corresponding path program 1 times [2021-10-13 00:13:23,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:23,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396187736] [2021-10-13 00:13:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:23,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:24,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:24,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396187736] [2021-10-13 00:13:24,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396187736] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:24,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:24,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:13:24,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397914691] [2021-10-13 00:13:24,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:24,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:24,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:24,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:24,045 INFO L87 Difference]: Start difference. First operand 921 states and 1224 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:13:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:24,452 INFO L93 Difference]: Finished difference Result 2233 states and 2923 transitions. [2021-10-13 00:13:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-10-13 00:13:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:24,460 INFO L225 Difference]: With dead ends: 2233 [2021-10-13 00:13:24,460 INFO L226 Difference]: Without dead ends: 1314 [2021-10-13 00:13:24,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-13 00:13:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2021-10-13 00:13:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2825719120135364) internal successors, (1516), 1182 states have internal predecessors, (1516), 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-13 00:13:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1516 transitions. [2021-10-13 00:13:24,504 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1516 transitions. Word has length 93 [2021-10-13 00:13:24,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:24,505 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1516 transitions. [2021-10-13 00:13:24,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:13:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1516 transitions. [2021-10-13 00:13:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-13 00:13:24,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:24,507 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:24,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:13:24,508 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:24,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1881650894, now seen corresponding path program 1 times [2021-10-13 00:13:24,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:24,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267451774] [2021-10-13 00:13:24,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:24,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:24,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:24,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267451774] [2021-10-13 00:13:24,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267451774] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:24,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:24,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:13:24,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428546977] [2021-10-13 00:13:24,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:13:24,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:13:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:13:24,627 INFO L87 Difference]: Start difference. First operand 1183 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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-13 00:13:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:25,265 INFO L93 Difference]: Finished difference Result 2757 states and 3471 transitions. [2021-10-13 00:13:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:13:25,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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) Word has length 97 [2021-10-13 00:13:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:25,274 INFO L225 Difference]: With dead ends: 2757 [2021-10-13 00:13:25,274 INFO L226 Difference]: Without dead ends: 1576 [2021-10-13 00:13:25,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:13:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2021-10-13 00:13:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2021-10-13 00:13:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2479224376731302) internal successors, (1802), 1444 states have internal predecessors, (1802), 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-13 00:13:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1802 transitions. [2021-10-13 00:13:25,311 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1802 transitions. Word has length 97 [2021-10-13 00:13:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:25,311 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1802 transitions. [2021-10-13 00:13:25,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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-13 00:13:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1802 transitions. [2021-10-13 00:13:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-13 00:13:25,314 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:25,314 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:13:25,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:13:25,314 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:25,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1608862799, now seen corresponding path program 1 times [2021-10-13 00:13:25,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:25,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481490939] [2021-10-13 00:13:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:25,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:25,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:25,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481490939] [2021-10-13 00:13:25,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481490939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:25,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:25,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:13:25,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623436522] [2021-10-13 00:13:25,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:25,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:25,400 INFO L87 Difference]: Start difference. First operand 1445 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-13 00:13:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:25,828 INFO L93 Difference]: Finished difference Result 3019 states and 3739 transitions. [2021-10-13 00:13:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) Word has length 115 [2021-10-13 00:13:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:25,838 INFO L225 Difference]: With dead ends: 3019 [2021-10-13 00:13:25,838 INFO L226 Difference]: Without dead ends: 1576 [2021-10-13 00:13:25,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2021-10-13 00:13:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2021-10-13 00:13:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2049861495844876) internal successors, (1740), 1444 states have internal predecessors, (1740), 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-13 00:13:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1740 transitions. [2021-10-13 00:13:25,878 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1740 transitions. Word has length 115 [2021-10-13 00:13:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:25,879 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1740 transitions. [2021-10-13 00:13:25,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-13 00:13:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1740 transitions. [2021-10-13 00:13:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-13 00:13:25,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:25,882 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:25,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:13:25,882 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2091244910, now seen corresponding path program 1 times [2021-10-13 00:13:25,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:25,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240458424] [2021-10-13 00:13:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:25,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-10-13 00:13:26,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:26,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240458424] [2021-10-13 00:13:26,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240458424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:26,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:13:26,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:13:26,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189953710] [2021-10-13 00:13:26,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:26,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:26,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:26,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:26,014 INFO L87 Difference]: Start difference. First operand 1445 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-13 00:13:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:26,409 INFO L93 Difference]: Finished difference Result 1709 states and 2052 transitions. [2021-10-13 00:13:26,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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) Word has length 128 [2021-10-13 00:13:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:26,418 INFO L225 Difference]: With dead ends: 1709 [2021-10-13 00:13:26,419 INFO L226 Difference]: Without dead ends: 1707 [2021-10-13 00:13:26,419 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:13:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-10-13 00:13:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2021-10-13 00:13:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2146031746031747) internal successors, (1913), 1575 states have internal predecessors, (1913), 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-13 00:13:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1913 transitions. [2021-10-13 00:13:26,455 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1913 transitions. Word has length 128 [2021-10-13 00:13:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:26,455 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1913 transitions. [2021-10-13 00:13:26,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-13 00:13:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1913 transitions. [2021-10-13 00:13:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-13 00:13:26,458 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:26,458 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:26,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:13:26,459 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash -734135293, now seen corresponding path program 1 times [2021-10-13 00:13:26,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:26,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525206580] [2021-10-13 00:13:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:26,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:26,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:26,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525206580] [2021-10-13 00:13:26,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525206580] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:13:26,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963342775] [2021-10-13 00:13:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:26,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:13:26,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:13:26,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:13:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:26,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:13:26,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:13:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 00:13:27,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963342775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:27,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:13:27,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-13 00:13:27,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745947165] [2021-10-13 00:13:27,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:27,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:13:27,055 INFO L87 Difference]: Start difference. First operand 1576 states and 1913 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-13 00:13:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:27,522 INFO L93 Difference]: Finished difference Result 3543 states and 4308 transitions. [2021-10-13 00:13:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) Word has length 128 [2021-10-13 00:13:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:27,533 INFO L225 Difference]: With dead ends: 3543 [2021-10-13 00:13:27,533 INFO L226 Difference]: Without dead ends: 1838 [2021-10-13 00:13:27,535 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:13:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-10-13 00:13:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2021-10-13 00:13:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.111957796014068) internal successors, (1897), 1706 states have internal predecessors, (1897), 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-13 00:13:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1897 transitions. [2021-10-13 00:13:27,576 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1897 transitions. Word has length 128 [2021-10-13 00:13:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:27,576 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 1897 transitions. [2021-10-13 00:13:27,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-13 00:13:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1897 transitions. [2021-10-13 00:13:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-10-13 00:13:27,580 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:27,580 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:27,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:13:27,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:27,803 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1137952742, now seen corresponding path program 1 times [2021-10-13 00:13:27,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:27,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408929385] [2021-10-13 00:13:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:27,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:13:27,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:27,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408929385] [2021-10-13 00:13:27,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408929385] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:13:27,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357672917] [2021-10-13 00:13:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:27,895 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:13:27,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:13:27,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:13:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:28,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 00:13:28,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:13:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-10-13 00:13:28,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357672917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:28,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:13:28,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-13 00:13:28,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912150082] [2021-10-13 00:13:28,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:28,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:13:28,411 INFO L87 Difference]: Start difference. First operand 1707 states and 1897 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-13 00:13:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:28,760 INFO L93 Difference]: Finished difference Result 3805 states and 4252 transitions. [2021-10-13 00:13:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) Word has length 145 [2021-10-13 00:13:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:28,771 INFO L225 Difference]: With dead ends: 3805 [2021-10-13 00:13:28,771 INFO L226 Difference]: Without dead ends: 2100 [2021-10-13 00:13:28,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:13:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-10-13 00:13:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1576. [2021-10-13 00:13:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.0888888888888888) internal successors, (1715), 1575 states have internal predecessors, (1715), 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-13 00:13:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1715 transitions. [2021-10-13 00:13:28,849 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1715 transitions. Word has length 145 [2021-10-13 00:13:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:28,850 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1715 transitions. [2021-10-13 00:13:28,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-13 00:13:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1715 transitions. [2021-10-13 00:13:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-10-13 00:13:28,854 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:28,855 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:28,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:13:29,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-13 00:13:29,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:29,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1546525125, now seen corresponding path program 1 times [2021-10-13 00:13:29,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:29,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137097026] [2021-10-13 00:13:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:29,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 94 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-13 00:13:29,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:29,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137097026] [2021-10-13 00:13:29,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137097026] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:13:29,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853796083] [2021-10-13 00:13:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:29,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:29,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:13:29,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:13:29,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:13:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:29,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 00:13:29,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:13:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-13 00:13:29,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853796083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:29,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:13:29,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-13 00:13:29,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655826282] [2021-10-13 00:13:29,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:13:29,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:13:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:13:29,867 INFO L87 Difference]: Start difference. First operand 1576 states and 1715 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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-13 00:13:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:30,458 INFO L93 Difference]: Finished difference Result 3805 states and 4157 transitions. [2021-10-13 00:13:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:13:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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) Word has length 192 [2021-10-13 00:13:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:30,469 INFO L225 Difference]: With dead ends: 3805 [2021-10-13 00:13:30,469 INFO L226 Difference]: Without dead ends: 2231 [2021-10-13 00:13:30,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:13:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-10-13 00:13:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2021-10-13 00:13:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.08130081300813) internal successors, (2128), 1968 states have internal predecessors, (2128), 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-13 00:13:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2128 transitions. [2021-10-13 00:13:30,537 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2128 transitions. Word has length 192 [2021-10-13 00:13:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:30,537 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2128 transitions. [2021-10-13 00:13:30,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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-13 00:13:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2128 transitions. [2021-10-13 00:13:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-10-13 00:13:30,543 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:30,544 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:30,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:13:30,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:30,758 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1110308090, now seen corresponding path program 1 times [2021-10-13 00:13:30,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:30,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807614301] [2021-10-13 00:13:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:30,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 131 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-13 00:13:30,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:30,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807614301] [2021-10-13 00:13:30,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807614301] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:13:30,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259602055] [2021-10-13 00:13:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:30,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:30,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:13:30,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:13:30,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 00:13:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:31,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 00:13:31,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:13:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-13 00:13:31,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259602055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:31,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:13:31,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-10-13 00:13:31,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913190031] [2021-10-13 00:13:31,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:31,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:31,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:13:31,689 INFO L87 Difference]: Start difference. First operand 1969 states and 2128 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-13 00:13:32,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:32,042 INFO L93 Difference]: Finished difference Result 4067 states and 4388 transitions. [2021-10-13 00:13:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:32,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) Word has length 205 [2021-10-13 00:13:32,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:32,053 INFO L225 Difference]: With dead ends: 4067 [2021-10-13 00:13:32,053 INFO L226 Difference]: Without dead ends: 2100 [2021-10-13 00:13:32,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:13:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-10-13 00:13:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2021-10-13 00:13:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.073678861788618) internal successors, (2113), 1968 states have internal predecessors, (2113), 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-13 00:13:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2113 transitions. [2021-10-13 00:13:32,098 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2113 transitions. Word has length 205 [2021-10-13 00:13:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:32,098 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2113 transitions. [2021-10-13 00:13:32,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-13 00:13:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2113 transitions. [2021-10-13 00:13:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-10-13 00:13:32,105 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:32,105 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:32,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:13:32,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:32,331 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:32,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:32,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1745901479, now seen corresponding path program 1 times [2021-10-13 00:13:32,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:32,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22193045] [2021-10-13 00:13:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:32,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 252 proven. 38 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-10-13 00:13:32,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:13:32,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22193045] [2021-10-13 00:13:32,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22193045] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:13:32,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145410859] [2021-10-13 00:13:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:32,492 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:13:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:13:32,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:13:32,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 00:13:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:13:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:13:32,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:13:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-10-13 00:13:33,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145410859] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:13:33,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:13:33,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-10-13 00:13:33,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507005448] [2021-10-13 00:13:33,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:13:33,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:13:33,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:13:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:13:33,509 INFO L87 Difference]: Start difference. First operand 1969 states and 2113 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-13 00:13:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:13:33,870 INFO L93 Difference]: Finished difference Result 4198 states and 4507 transitions. [2021-10-13 00:13:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:13:33,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) Word has length 261 [2021-10-13 00:13:33,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:13:33,886 INFO L225 Difference]: With dead ends: 4198 [2021-10-13 00:13:33,886 INFO L226 Difference]: Without dead ends: 2231 [2021-10-13 00:13:33,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:13:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-10-13 00:13:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1838. [2021-10-13 00:13:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0691344583560152) internal successors, (1964), 1837 states have internal predecessors, (1964), 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-13 00:13:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1964 transitions. [2021-10-13 00:13:33,931 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1964 transitions. Word has length 261 [2021-10-13 00:13:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:13:33,932 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 1964 transitions. [2021-10-13 00:13:33,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-13 00:13:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1964 transitions. [2021-10-13 00:13:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2021-10-13 00:13:33,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:13:33,939 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:13:33,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:13:34,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-13 00:13:34,159 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:13:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:13:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash -866356035, now seen corresponding path program 1 times [2021-10-13 00:13:34,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:13:34,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921077647] [2021-10-13 00:13:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:13:34,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:13:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:13:34,228 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:13:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:13:34,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:13:34,446 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:13:34,447 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:13:34,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:13:34,457 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:13:34,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:13:34 BoogieIcfgContainer [2021-10-13 00:13:34,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:13:34,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:13:34,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:13:34,719 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:13:34,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:13:20" (3/4) ... [2021-10-13 00:13:34,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:13:34,957 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:13:34,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:13:34,959 INFO L168 Benchmark]: Toolchain (without parser) took 16269.79 ms. Allocated memory was 113.2 MB in the beginning and 260.0 MB in the end (delta: 146.8 MB). Free memory was 73.0 MB in the beginning and 137.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 82.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,959 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 113.2 MB. Free memory is still 91.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:13:34,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.66 ms. Allocated memory is still 113.2 MB. Free memory was 72.8 MB in the beginning and 71.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.42 ms. Allocated memory is still 113.2 MB. Free memory was 70.8 MB in the beginning and 65.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,961 INFO L168 Benchmark]: Boogie Preprocessor took 55.63 ms. Allocated memory is still 113.2 MB. Free memory was 65.2 MB in the beginning and 60.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,961 INFO L168 Benchmark]: RCFGBuilder took 1244.46 ms. Allocated memory is still 113.2 MB. Free memory was 60.6 MB in the beginning and 50.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,961 INFO L168 Benchmark]: TraceAbstraction took 13990.41 ms. Allocated memory was 113.2 MB in the beginning and 260.0 MB in the end (delta: 146.8 MB). Free memory was 49.7 MB in the beginning and 180.2 MB in the end (delta: -130.6 MB). Peak memory consumption was 99.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,962 INFO L168 Benchmark]: Witness Printer took 240.31 ms. Allocated memory is still 260.0 MB. Free memory was 180.2 MB in the beginning and 137.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:34,964 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.26 ms. Allocated memory is still 113.2 MB. Free memory is still 91.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 628.66 ms. Allocated memory is still 113.2 MB. Free memory was 72.8 MB in the beginning and 71.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.42 ms. Allocated memory is still 113.2 MB. Free memory was 70.8 MB in the beginning and 65.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.63 ms. Allocated memory is still 113.2 MB. Free memory was 65.2 MB in the beginning and 60.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1244.46 ms. Allocated memory is still 113.2 MB. Free memory was 60.6 MB in the beginning and 50.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13990.41 ms. Allocated memory was 113.2 MB in the beginning and 260.0 MB in the end (delta: 146.8 MB). Free memory was 49.7 MB in the beginning and 180.2 MB in the end (delta: -130.6 MB). Peak memory consumption was 99.1 MB. Max. memory is 16.1 GB. * Witness Printer took 240.31 ms. Allocated memory is still 260.0 MB. Free memory was 180.2 MB in the beginning and 137.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 420]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] reach_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13650.5ms, OverallIterations: 14, TraceHistogramMax: 7, EmptinessCheckTime: 72.5ms, AutomataDifference: 6316.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 918 SDtfs, 1822 SDslu, 75 SDs, 0 SdLazy, 4575 SolverSat, 730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4375.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 934 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 116.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=11, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 598.6ms AutomataMinimizationTime, 13 MinimizatonAttempts, 1965 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 292.2ms SsaConstructionTime, 650.5ms SatisfiabilityAnalysisTime, 3350.1ms InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2616 ConstructedInterpolants, 0 QuantifiedInterpolants, 6648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1866 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 1920/2015 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:13:35,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26fec219-bab3-4a4d-acfe-fa38b49e67a5/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...