./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.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_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e85b5d766a169d89046ca9aaa9cab788a1f4fb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:42:24,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:42:24,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:42:24,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:42:24,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:42:24,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:42:24,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:42:24,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:42:24,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:42:24,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:42:24,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:42:24,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:42:24,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:42:24,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:42:24,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:42:24,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:42:24,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:42:24,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:42:24,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:42:24,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:42:24,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:42:24,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:42:24,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:42:24,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:42:24,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:42:24,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:42:24,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:42:24,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:42:24,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:42:24,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:42:24,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:42:24,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:42:24,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:42:24,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:42:24,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:42:24,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:42:24,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:42:24,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:42:24,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:42:24,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:42:24,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:42:24,461 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:42:24,518 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:42:24,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:42:24,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:42:24,520 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:42:24,520 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:42:24,521 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:42:24,521 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:42:24,521 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:42:24,529 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:42:24,530 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:42:24,531 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:42:24,532 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:42:24,532 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:42:24,532 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:42:24,533 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:42:24,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:42:24,535 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:42:24,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:42:24,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:42:24,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:42:24,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:42:24,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:42:24,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:42:24,537 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:42:24,537 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:42:24,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:42:24,538 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:42:24,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:42:24,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:42:24,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:42:24,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:42:24,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:42:24,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:42:24,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:42:24,542 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:42:24,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:42:24,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:42:24,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:42:24,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:42:24,544 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/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_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> 8e85b5d766a169d89046ca9aaa9cab788a1f4fb1 [2021-10-13 07:42:24,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:42:24,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:42:24,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:42:24,899 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:42:24,900 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:42:24,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2021-10-13 07:42:24,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/data/529fa14ec/f2d7820cabd34768b31cf7fa5425bf56/FLAGe29f67188 [2021-10-13 07:42:25,661 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:42:25,662 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2021-10-13 07:42:25,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/data/529fa14ec/f2d7820cabd34768b31cf7fa5425bf56/FLAGe29f67188 [2021-10-13 07:42:25,880 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/data/529fa14ec/f2d7820cabd34768b31cf7fa5425bf56 [2021-10-13 07:42:25,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:42:25,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:42:25,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:42:25,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:42:25,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:42:25,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:42:25" (1/1) ... [2021-10-13 07:42:25,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12118e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:25, skipping insertion in model container [2021-10-13 07:42:25,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:42:25" (1/1) ... [2021-10-13 07:42:25,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:42:25,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:42:26,403 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_434d84d3-ce42-48ae-b764-15f20ec37530/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2021-10-13 07:42:26,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:42:26,489 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:42:26,597 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_434d84d3-ce42-48ae-b764-15f20ec37530/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2021-10-13 07:42:26,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:42:26,664 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:42:26,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26 WrapperNode [2021-10-13 07:42:26,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:42:26,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:42:26,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:42:26,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:42:26,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:42:26,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:42:26,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:42:26,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:42:26,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:42:26,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:42:26,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:42:26,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:42:26,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (1/1) ... [2021-10-13 07:42:26,936 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:42:26,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:42:26,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:42:26,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:42:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:42:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:42:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:42:27,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:42:29,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:42:29,082 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 07:42:29,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:42:29 BoogieIcfgContainer [2021-10-13 07:42:29,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:42:29,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:42:29,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:42:29,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:42:29,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:42:25" (1/3) ... [2021-10-13 07:42:29,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac357b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:42:29, skipping insertion in model container [2021-10-13 07:42:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:42:26" (2/3) ... [2021-10-13 07:42:29,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac357b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:42:29, skipping insertion in model container [2021-10-13 07:42:29,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:42:29" (3/3) ... [2021-10-13 07:42:29,100 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2021-10-13 07:42:29,110 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:42:29,110 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:42:29,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:42:29,177 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 07:42:29,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:42:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 74 states have (on average 1.945945945945946) internal successors, (144), 75 states have internal predecessors, (144), 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 07:42:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-13 07:42:29,206 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:29,206 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] [2021-10-13 07:42:29,207 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 379008702, now seen corresponding path program 1 times [2021-10-13 07:42:29,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:29,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996856666] [2021-10-13 07:42:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:29,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:29,694 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 07:42:29,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:29,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996856666] [2021-10-13 07:42:29,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996856666] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:29,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:29,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:42:29,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368633066] [2021-10-13 07:42:29,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:29,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:29,735 INFO L87 Difference]: Start difference. First operand has 76 states, 74 states have (on average 1.945945945945946) internal successors, (144), 75 states have internal predecessors, (144), 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 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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 07:42:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:30,219 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2021-10-13 07:42:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:30,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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 71 [2021-10-13 07:42:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:30,241 INFO L225 Difference]: With dead ends: 224 [2021-10-13 07:42:30,241 INFO L226 Difference]: Without dead ends: 145 [2021-10-13 07:42:30,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-13 07:42:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-10-13 07:42:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7986111111111112) internal successors, (259), 144 states have internal predecessors, (259), 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 07:42:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2021-10-13 07:42:30,314 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2021-10-13 07:42:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:30,315 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2021-10-13 07:42:30,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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 07:42:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2021-10-13 07:42:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-13 07:42:30,321 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:30,321 INFO L512 BasicCegarLoop]: trace histogram [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 07:42:30,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:42:30,322 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash -615353007, now seen corresponding path program 1 times [2021-10-13 07:42:30,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:30,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958693098] [2021-10-13 07:42:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:30,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:42:30,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:30,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958693098] [2021-10-13 07:42:30,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958693098] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:30,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:30,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:42:30,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689104419] [2021-10-13 07:42:30,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:30,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:30,407 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 07:42:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:30,939 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2021-10-13 07:42:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2021-10-13 07:42:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:30,943 INFO L225 Difference]: With dead ends: 431 [2021-10-13 07:42:30,943 INFO L226 Difference]: Without dead ends: 287 [2021-10-13 07:42:30,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-13 07:42:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2021-10-13 07:42:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.6363636363636365) internal successors, (468), 286 states have internal predecessors, (468), 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 07:42:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 468 transitions. [2021-10-13 07:42:30,985 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 468 transitions. Word has length 77 [2021-10-13 07:42:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:30,986 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 468 transitions. [2021-10-13 07:42:30,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 07:42:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 468 transitions. [2021-10-13 07:42:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 07:42:30,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:30,997 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:42:30,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:42:30,998 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1583670607, now seen corresponding path program 1 times [2021-10-13 07:42:30,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:30,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096846163] [2021-10-13 07:42:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:31,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:42:31,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:31,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096846163] [2021-10-13 07:42:31,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096846163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:31,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:31,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:42:31,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463718448] [2021-10-13 07:42:31,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:31,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:31,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:31,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:31,164 INFO L87 Difference]: Start difference. First operand 287 states and 468 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 07:42:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:31,600 INFO L93 Difference]: Finished difference Result 786 states and 1306 transitions. [2021-10-13 07:42:31,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:31,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 07:42:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:31,606 INFO L225 Difference]: With dead ends: 786 [2021-10-13 07:42:31,606 INFO L226 Difference]: Without dead ends: 500 [2021-10-13 07:42:31,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-10-13 07:42:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 429. [2021-10-13 07:42:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.4953271028037383) internal successors, (640), 428 states have internal predecessors, (640), 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 07:42:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 640 transitions. [2021-10-13 07:42:31,638 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 640 transitions. Word has length 78 [2021-10-13 07:42:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:31,639 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 640 transitions. [2021-10-13 07:42:31,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 07:42:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 640 transitions. [2021-10-13 07:42:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-13 07:42:31,643 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:31,644 INFO L512 BasicCegarLoop]: trace histogram [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 07:42:31,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:42:31,644 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 802990508, now seen corresponding path program 1 times [2021-10-13 07:42:31,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:31,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24926306] [2021-10-13 07:42:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:31,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:42:31,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:31,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24926306] [2021-10-13 07:42:31,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24926306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:31,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:31,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:42:31,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121645002] [2021-10-13 07:42:31,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:31,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:31,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:31,731 INFO L87 Difference]: Start difference. First operand 429 states and 640 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 07:42:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:32,055 INFO L93 Difference]: Finished difference Result 928 states and 1374 transitions. [2021-10-13 07:42:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:32,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2021-10-13 07:42:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:32,058 INFO L225 Difference]: With dead ends: 928 [2021-10-13 07:42:32,058 INFO L226 Difference]: Without dead ends: 429 [2021-10-13 07:42:32,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-13 07:42:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2021-10-13 07:42:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.2757009345794392) internal successors, (546), 428 states have internal predecessors, (546), 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 07:42:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 546 transitions. [2021-10-13 07:42:32,078 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 546 transitions. Word has length 79 [2021-10-13 07:42:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:32,078 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 546 transitions. [2021-10-13 07:42:32,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 07:42:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 546 transitions. [2021-10-13 07:42:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-13 07:42:32,081 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:32,081 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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 07:42:32,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:42:32,082 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash 713123812, now seen corresponding path program 1 times [2021-10-13 07:42:32,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:32,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493396243] [2021-10-13 07:42:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:32,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 07:42:32,136 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:32,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493396243] [2021-10-13 07:42:32,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493396243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:32,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:32,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:42:32,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604906713] [2021-10-13 07:42:32,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:32,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:32,140 INFO L87 Difference]: Start difference. First operand 429 states and 546 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 07:42:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:32,417 INFO L93 Difference]: Finished difference Result 1070 states and 1348 transitions. [2021-10-13 07:42:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:32,418 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 83 [2021-10-13 07:42:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:32,422 INFO L225 Difference]: With dead ends: 1070 [2021-10-13 07:42:32,423 INFO L226 Difference]: Without dead ends: 642 [2021-10-13 07:42:32,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-13 07:42:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2021-10-13 07:42:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.2403508771929825) internal successors, (707), 570 states have internal predecessors, (707), 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 07:42:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 707 transitions. [2021-10-13 07:42:32,447 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 707 transitions. Word has length 83 [2021-10-13 07:42:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:32,447 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 707 transitions. [2021-10-13 07:42:32,448 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 07:42:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 707 transitions. [2021-10-13 07:42:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-13 07:42:32,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:32,451 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 07:42:32,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:42:32,451 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:32,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1122588372, now seen corresponding path program 1 times [2021-10-13 07:42:32,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:32,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674444916] [2021-10-13 07:42:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:32,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:42:32,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:32,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674444916] [2021-10-13 07:42:32,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674444916] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:32,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:32,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:42:32,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021958149] [2021-10-13 07:42:32,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:32,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:32,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:32,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:32,566 INFO L87 Difference]: Start difference. First operand 571 states and 707 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 07:42:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:32,928 INFO L93 Difference]: Finished difference Result 1496 states and 1845 transitions. [2021-10-13 07:42:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 07:42:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:32,935 INFO L225 Difference]: With dead ends: 1496 [2021-10-13 07:42:32,935 INFO L226 Difference]: Without dead ends: 926 [2021-10-13 07:42:32,937 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-10-13 07:42:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 713. [2021-10-13 07:42:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.2429775280898876) internal successors, (885), 712 states have internal predecessors, (885), 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 07:42:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 885 transitions. [2021-10-13 07:42:32,981 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 885 transitions. Word has length 97 [2021-10-13 07:42:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:32,981 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 885 transitions. [2021-10-13 07:42:32,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 07:42:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 885 transitions. [2021-10-13 07:42:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-13 07:42:32,986 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:32,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:42:32,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:42:32,987 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1560485274, now seen corresponding path program 1 times [2021-10-13 07:42:32,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:32,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767655656] [2021-10-13 07:42:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:32,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:42:33,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:33,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767655656] [2021-10-13 07:42:33,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767655656] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:33,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:33,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:42:33,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137107934] [2021-10-13 07:42:33,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:33,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:33,095 INFO L87 Difference]: Start difference. First operand 713 states and 885 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:42:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:33,413 INFO L93 Difference]: Finished difference Result 1496 states and 1863 transitions. [2021-10-13 07:42:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-10-13 07:42:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:33,420 INFO L225 Difference]: With dead ends: 1496 [2021-10-13 07:42:33,420 INFO L226 Difference]: Without dead ends: 784 [2021-10-13 07:42:33,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-10-13 07:42:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2021-10-13 07:42:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.2375478927203065) internal successors, (969), 783 states have internal predecessors, (969), 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 07:42:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 969 transitions. [2021-10-13 07:42:33,452 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 969 transitions. Word has length 113 [2021-10-13 07:42:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:33,453 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 969 transitions. [2021-10-13 07:42:33,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:42:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 969 transitions. [2021-10-13 07:42:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-13 07:42:33,456 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:33,457 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:42:33,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:42:33,457 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1381765790, now seen corresponding path program 1 times [2021-10-13 07:42:33,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:33,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363639886] [2021-10-13 07:42:33,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:33,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:42:33,555 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:33,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363639886] [2021-10-13 07:42:33,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363639886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:33,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:33,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:42:33,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155278372] [2021-10-13 07:42:33,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:42:33,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:33,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:42:33,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:42:33,559 INFO L87 Difference]: Start difference. First operand 784 states and 969 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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 07:42:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:34,119 INFO L93 Difference]: Finished difference Result 1922 states and 2385 transitions. [2021-10-13 07:42:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:42:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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 117 [2021-10-13 07:42:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:34,128 INFO L225 Difference]: With dead ends: 1922 [2021-10-13 07:42:34,128 INFO L226 Difference]: Without dead ends: 1068 [2021-10-13 07:42:34,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:42:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-10-13 07:42:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2021-10-13 07:42:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 1.1733833177132147) internal successors, (1252), 1067 states have internal predecessors, (1252), 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 07:42:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1252 transitions. [2021-10-13 07:42:34,169 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1252 transitions. Word has length 117 [2021-10-13 07:42:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:34,169 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1252 transitions. [2021-10-13 07:42:34,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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 07:42:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1252 transitions. [2021-10-13 07:42:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-13 07:42:34,174 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:34,174 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 07:42:34,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:42:34,175 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:34,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1736592219, now seen corresponding path program 1 times [2021-10-13 07:42:34,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:34,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995978446] [2021-10-13 07:42:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:34,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:42:34,263 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:34,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995978446] [2021-10-13 07:42:34,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995978446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:34,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:34,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:42:34,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854502049] [2021-10-13 07:42:34,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:42:34,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:42:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:42:34,267 INFO L87 Difference]: Start difference. First operand 1068 states and 1252 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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 07:42:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:34,790 INFO L93 Difference]: Finished difference Result 2419 states and 2840 transitions. [2021-10-13 07:42:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:42:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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 134 [2021-10-13 07:42:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:34,800 INFO L225 Difference]: With dead ends: 2419 [2021-10-13 07:42:34,801 INFO L226 Difference]: Without dead ends: 1281 [2021-10-13 07:42:34,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:42:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2021-10-13 07:42:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 926. [2021-10-13 07:42:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.145945945945946) internal successors, (1060), 925 states have internal predecessors, (1060), 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 07:42:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1060 transitions. [2021-10-13 07:42:34,841 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1060 transitions. Word has length 134 [2021-10-13 07:42:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:34,841 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1060 transitions. [2021-10-13 07:42:34,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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 07:42:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1060 transitions. [2021-10-13 07:42:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-13 07:42:34,846 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:34,846 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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 07:42:34,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:42:34,847 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2007496956, now seen corresponding path program 1 times [2021-10-13 07:42:34,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:34,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548833072] [2021-10-13 07:42:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:34,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 07:42:34,922 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:34,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548833072] [2021-10-13 07:42:34,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548833072] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:34,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:34,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:42:34,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235526075] [2021-10-13 07:42:34,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:42:34,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:42:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:42:34,925 INFO L87 Difference]: Start difference. First operand 926 states and 1060 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:42:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:35,402 INFO L93 Difference]: Finished difference Result 1993 states and 2280 transitions. [2021-10-13 07:42:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:42:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-10-13 07:42:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:35,410 INFO L225 Difference]: With dead ends: 1993 [2021-10-13 07:42:35,410 INFO L226 Difference]: Without dead ends: 1068 [2021-10-13 07:42:35,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:42:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-10-13 07:42:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2021-10-13 07:42:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 1.1365461847389557) internal successors, (1132), 996 states have internal predecessors, (1132), 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 07:42:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1132 transitions. [2021-10-13 07:42:35,449 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1132 transitions. Word has length 159 [2021-10-13 07:42:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:35,450 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 1132 transitions. [2021-10-13 07:42:35,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:42:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1132 transitions. [2021-10-13 07:42:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-10-13 07:42:35,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:35,454 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-10-13 07:42:35,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:42:35,455 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1971807067, now seen corresponding path program 1 times [2021-10-13 07:42:35,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:35,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298036380] [2021-10-13 07:42:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:35,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-13 07:42:35,558 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:35,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298036380] [2021-10-13 07:42:35,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298036380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:35,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:42:35,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:42:35,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866606447] [2021-10-13 07:42:35,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:35,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:35,561 INFO L87 Difference]: Start difference. First operand 997 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 07:42:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:35,852 INFO L93 Difference]: Finished difference Result 2206 states and 2506 transitions. [2021-10-13 07:42:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 177 [2021-10-13 07:42:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:35,860 INFO L225 Difference]: With dead ends: 2206 [2021-10-13 07:42:35,860 INFO L226 Difference]: Without dead ends: 1210 [2021-10-13 07:42:35,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:42:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2021-10-13 07:42:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1139. [2021-10-13 07:42:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.1221441124780316) internal successors, (1277), 1138 states have internal predecessors, (1277), 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 07:42:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1277 transitions. [2021-10-13 07:42:35,898 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1277 transitions. Word has length 177 [2021-10-13 07:42:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:35,898 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1277 transitions. [2021-10-13 07:42:35,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 07:42:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1277 transitions. [2021-10-13 07:42:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-10-13 07:42:35,903 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:35,903 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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 07:42:35,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:42:35,904 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash 10503154, now seen corresponding path program 1 times [2021-10-13 07:42:35,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:35,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677859973] [2021-10-13 07:42:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:35,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 126 proven. 69 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-10-13 07:42:36,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:42:36,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677859973] [2021-10-13 07:42:36,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677859973] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:42:36,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231463598] [2021-10-13 07:42:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:36,150 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:42:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:42:36,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:42:36,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:42:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:42:36,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:42:36,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:42:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-10-13 07:42:37,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:42:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-10-13 07:42:37,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231463598] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:42:37,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:42:37,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2021-10-13 07:42:37,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614410284] [2021-10-13 07:42:37,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:42:37,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:42:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:42:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:42:37,669 INFO L87 Difference]: Start difference. First operand 1139 states and 1277 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 07:42:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:42:37,968 INFO L93 Difference]: Finished difference Result 2561 states and 2860 transitions. [2021-10-13 07:42:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:42:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 199 [2021-10-13 07:42:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:42:37,978 INFO L225 Difference]: With dead ends: 2561 [2021-10-13 07:42:37,978 INFO L226 Difference]: Without dead ends: 1352 [2021-10-13 07:42:37,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:42:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-10-13 07:42:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2021-10-13 07:42:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.115992970123023) internal successors, (1270), 1138 states have internal predecessors, (1270), 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 07:42:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1270 transitions. [2021-10-13 07:42:38,026 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1270 transitions. Word has length 199 [2021-10-13 07:42:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:42:38,027 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1270 transitions. [2021-10-13 07:42:38,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 07:42:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1270 transitions. [2021-10-13 07:42:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-10-13 07:42:38,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:42:38,034 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:42:38,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:42:38,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-13 07:42:38,253 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:42:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:42:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1850477800, now seen corresponding path program 1 times [2021-10-13 07:42:38,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:42:38,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26141038] [2021-10-13 07:42:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:42:38,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:42:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:42:38,321 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:42:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:42:38,525 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:42:38,525 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:42:38,526 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:42:38,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:42:38,535 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:42:38,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:42:38 BoogieIcfgContainer [2021-10-13 07:42:38,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:42:38,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:42:38,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:42:38,810 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:42:38,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:42:29" (3/4) ... [2021-10-13 07:42:38,813 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:42:39,047 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:42:39,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:42:39,049 INFO L168 Benchmark]: Toolchain (without parser) took 13160.35 ms. Allocated memory was 113.2 MB in the beginning and 247.5 MB in the end (delta: 134.2 MB). Free memory was 78.0 MB in the beginning and 123.5 MB in the end (delta: -45.5 MB). Peak memory consumption was 89.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,049 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 113.2 MB. Free memory is still 66.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:42:39,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.21 ms. Allocated memory is still 113.2 MB. Free memory was 78.0 MB in the beginning and 69.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.40 ms. Allocated memory is still 113.2 MB. Free memory was 69.9 MB in the beginning and 64.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,051 INFO L168 Benchmark]: Boogie Preprocessor took 124.01 ms. Allocated memory is still 113.2 MB. Free memory was 64.3 MB in the beginning and 60.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,051 INFO L168 Benchmark]: RCFGBuilder took 2164.02 ms. Allocated memory was 113.2 MB in the beginning and 144.7 MB in the end (delta: 31.5 MB). Free memory was 59.8 MB in the beginning and 66.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,052 INFO L168 Benchmark]: TraceAbstraction took 9718.45 ms. Allocated memory was 144.7 MB in the beginning and 247.5 MB in the end (delta: 102.8 MB). Free memory was 65.6 MB in the beginning and 161.4 MB in the end (delta: -95.8 MB). Peak memory consumption was 100.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,052 INFO L168 Benchmark]: Witness Printer took 237.12 ms. Allocated memory is still 247.5 MB. Free memory was 161.4 MB in the beginning and 123.5 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:42:39,055 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.31 ms. Allocated memory is still 113.2 MB. Free memory is still 66.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 774.21 ms. Allocated memory is still 113.2 MB. Free memory was 78.0 MB in the beginning and 69.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 132.40 ms. Allocated memory is still 113.2 MB. Free memory was 69.9 MB in the beginning and 64.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 124.01 ms. Allocated memory is still 113.2 MB. Free memory was 64.3 MB in the beginning and 60.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2164.02 ms. Allocated memory was 113.2 MB in the beginning and 144.7 MB in the end (delta: 31.5 MB). Free memory was 59.8 MB in the beginning and 66.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9718.45 ms. Allocated memory was 144.7 MB in the beginning and 247.5 MB in the end (delta: 102.8 MB). Free memory was 65.6 MB in the beginning and 161.4 MB in the end (delta: -95.8 MB). Peak memory consumption was 100.2 MB. Max. memory is 16.1 GB. * Witness Printer took 237.12 ms. Allocated memory is still 247.5 MB. Free memory was 161.4 MB in the beginning and 123.5 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 432]: 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; [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 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L288] COND TRUE (((((((!(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)) [L289] a20 = 1 [L290] a8 = 13 [L291] a16 = 4 [L292] a7 = 0 [L293] a21 = 1 [L294] a17 = 0 [L295] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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 FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L432] reach_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9365.3ms, OverallIterations: 13, TraceHistogramMax: 6, EmptinessCheckTime: 64.3ms, AutomataDifference: 5044.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 517 SDtfs, 847 SDslu, 56 SDs, 0 SdLazy, 2758 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3484.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 101.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=11, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 433.6ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1065 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 173.2ms SsaConstructionTime, 450.7ms SatisfiabilityAnalysisTime, 2416.7ms InterpolantComputationTime, 1818 NumberOfCodeBlocks, 1818 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 5210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1232/1301 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 07:42:39,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_434d84d3-ce42-48ae-b764-15f20ec37530/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...