./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label26.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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label26.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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 eb2d628268fd49fbaa15bffb515ab88265361c46 ....................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label26.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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 eb2d628268fd49fbaa15bffb515ab88265361c46 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:47:28,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:47:28,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:47:28,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:47:28,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:47:28,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:47:28,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:47:28,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:47:28,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:47:28,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:47:28,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:47:28,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:47:28,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:47:28,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:47:28,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:47:28,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:47:28,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:47:28,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:47:28,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:47:28,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:47:28,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:47:28,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:47:28,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:47:28,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:47:28,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:47:28,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:47:28,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:47:28,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:47:28,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:47:28,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:47:28,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:47:28,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:47:28,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:47:28,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:47:28,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:47:28,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:47:28,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:47:28,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:47:28,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:47:28,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:47:28,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:47:28,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:47:28,568 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:47:28,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:47:28,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:47:28,570 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:47:28,570 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:47:28,571 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:47:28,571 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:47:28,571 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:47:28,572 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:47:28,572 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:47:28,572 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:47:28,573 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:47:28,573 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:47:28,573 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:47:28,574 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:47:28,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:47:28,575 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:47:28,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:47:28,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:47:28,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:47:28,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:47:28,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:47:28,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:47:28,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:47:28,577 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:47:28,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:47:28,578 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:47:28,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:47:28,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:47:28,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:47:28,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:47:28,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:47:28,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:47:28,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:47:28,580 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:47:28,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:47:28,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:47:28,581 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:47:28,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:47:28,582 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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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 -> eb2d628268fd49fbaa15bffb515ab88265361c46 [2021-10-13 07:47:28,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:47:28,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:47:28,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:47:28,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:47:28,910 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:47:28,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/eca-rers2012/Problem10_label26.c [2021-10-13 07:47:28,995 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/dd2c69ea7/c64a174af06b4ec2b9481fc1aa63ef4b/FLAGd6eb6f6e1 [2021-10-13 07:47:29,685 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:47:29,685 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/sv-benchmarks/c/eca-rers2012/Problem10_label26.c [2021-10-13 07:47:29,711 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/dd2c69ea7/c64a174af06b4ec2b9481fc1aa63ef4b/FLAGd6eb6f6e1 [2021-10-13 07:47:29,900 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/dd2c69ea7/c64a174af06b4ec2b9481fc1aa63ef4b [2021-10-13 07:47:29,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:47:29,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:47:29,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:47:29,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:47:29,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:47:29,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:47:29" (1/1) ... [2021-10-13 07:47:29,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e8a2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:29, skipping insertion in model container [2021-10-13 07:47:29,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:47:29" (1/1) ... [2021-10-13 07:47:29,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:47:30,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:47:30,266 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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/sv-benchmarks/c/eca-rers2012/Problem10_label26.c[2078,2091] [2021-10-13 07:47:30,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:47:30,536 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:47:30,554 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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/sv-benchmarks/c/eca-rers2012/Problem10_label26.c[2078,2091] [2021-10-13 07:47:30,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:47:30,647 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:47:30,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30 WrapperNode [2021-10-13 07:47:30,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:47:30,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:47:30,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:47:30,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:47:30,659 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:47:30" (1/1) ... [2021-10-13 07:47:30,682 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:47:30" (1/1) ... [2021-10-13 07:47:30,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:47:30,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:47:30,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:47:30,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:47:30,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:47:30,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:47:30,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:47:30,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:47:30,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (1/1) ... [2021-10-13 07:47:30,891 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:47:30,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:47:30,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:47:30,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:47:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:47:30,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:47:30,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:47:30,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:47:39,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:47:39,982 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 07:47:39,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:47:39 BoogieIcfgContainer [2021-10-13 07:47:39,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:47:39,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:47:39,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:47:39,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:47:39,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:47:29" (1/3) ... [2021-10-13 07:47:39,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a68c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:47:39, skipping insertion in model container [2021-10-13 07:47:39,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:47:30" (2/3) ... [2021-10-13 07:47:39,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a68c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:47:39, skipping insertion in model container [2021-10-13 07:47:39,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:47:39" (3/3) ... [2021-10-13 07:47:39,996 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label26.c [2021-10-13 07:47:40,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:47:40,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:47:40,061 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:47:40,071 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:47:40,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:47:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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:47:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 07:47:40,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:40,091 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 07:47:40,092 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 886085532, now seen corresponding path program 1 times [2021-10-13 07:47:40,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:40,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184262751] [2021-10-13 07:47:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:40,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:40,304 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:47:40,305 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:40,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184262751] [2021-10-13 07:47:40,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184262751] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:47:40,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:47:40,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:47:40,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476547655] [2021-10-13 07:47:40,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:47:40,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:47:40,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:47:40,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:40,331 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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:47:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:40,415 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2021-10-13 07:47:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:47:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-10-13 07:47:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:40,425 INFO L225 Difference]: With dead ends: 23 [2021-10-13 07:47:40,425 INFO L226 Difference]: Without dead ends: 11 [2021-10-13 07:47:40,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:47:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-13 07:47:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-10-13 07:47:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:47:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-10-13 07:47:40,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2021-10-13 07:47:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:40,462 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-10-13 07:47:40,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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:47:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-10-13 07:47:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:47:40,463 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:40,463 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-13 07:47:40,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:47:40,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash -344390540, now seen corresponding path program 1 times [2021-10-13 07:47:40,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:47:40,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966585812] [2021-10-13 07:47:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:40,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:47:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:47:40,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:47:40,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966585812] [2021-10-13 07:47:40,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966585812] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:47:40,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694339134] [2021-10-13 07:47:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:40,965 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:40,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:47:40,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:47:40,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:47:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:41,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 07:47:41,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:47:57,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:13,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:48:13,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1414332814] [2021-10-13 07:48:13,376 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-10-13 07:48:13,376 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:48:13,380 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:48:13,386 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:48:13,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:48:13,425 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,427 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:48:13,428 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,429 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 07:48:13,430 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:48:13,432 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,433 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:48:13,435 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-13 07:48:13,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:48:13,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:48:13,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:48:13,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 07:48:13,488 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,490 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:48:13,491 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,495 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:48:13,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:48:13,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:13,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,520 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:48:13,522 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-13 07:48:13,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:48:13,523 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:149, output treesize:152 [2021-10-13 07:48:13,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:48:13,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:13,753 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_10| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:48:13,757 INFO L168 Benchmark]: Toolchain (without parser) took 43851.61 ms. Allocated memory was 98.6 MB in the beginning and 1.0 GB in the end (delta: 937.4 MB). Free memory was 64.7 MB in the beginning and 835.3 MB in the end (delta: -770.7 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:13,758 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 98.6 MB. Free memory is still 54.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:48:13,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.06 ms. Allocated memory is still 98.6 MB. Free memory was 64.4 MB in the beginning and 58.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:13,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.44 ms. Allocated memory is still 98.6 MB. Free memory was 58.6 MB in the beginning and 51.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:13,760 INFO L168 Benchmark]: Boogie Preprocessor took 94.60 ms. Allocated memory is still 98.6 MB. Free memory was 50.6 MB in the beginning and 45.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:13,761 INFO L168 Benchmark]: RCFGBuilder took 9111.18 ms. Allocated memory was 98.6 MB in the beginning and 253.8 MB in the end (delta: 155.2 MB). Free memory was 45.9 MB in the beginning and 127.4 MB in the end (delta: -81.5 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:13,762 INFO L168 Benchmark]: TraceAbstraction took 33769.14 ms. Allocated memory was 253.8 MB in the beginning and 1.0 GB in the end (delta: 782.2 MB). Free memory was 126.4 MB in the beginning and 835.3 MB in the end (delta: -708.9 MB). Peak memory consumption was 74.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:13,766 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.30 ms. Allocated memory is still 98.6 MB. Free memory is still 54.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 737.06 ms. Allocated memory is still 98.6 MB. Free memory was 64.4 MB in the beginning and 58.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 118.44 ms. Allocated memory is still 98.6 MB. Free memory was 58.6 MB in the beginning and 51.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.60 ms. Allocated memory is still 98.6 MB. Free memory was 50.6 MB in the beginning and 45.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9111.18 ms. Allocated memory was 98.6 MB in the beginning and 253.8 MB in the end (delta: 155.2 MB). Free memory was 45.9 MB in the beginning and 127.4 MB in the end (delta: -81.5 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33769.14 ms. Allocated memory was 253.8 MB in the beginning and 1.0 GB in the end (delta: 782.2 MB). Free memory was 126.4 MB in the beginning and 835.3 MB in the end (delta: -708.9 MB). Peak memory consumption was 74.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_10| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_10|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 07:48:13,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:48:16,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:48:16,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:48:16,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:48:16,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:48:16,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:48:16,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:48:16,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:48:16,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:48:16,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:48:16,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:48:16,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:48:16,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:48:16,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:48:16,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:48:16,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:48:16,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:48:16,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:48:16,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:48:16,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:48:16,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:48:16,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:48:16,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:48:16,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:48:16,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:48:16,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:48:16,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:48:16,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:48:16,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:48:16,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:48:16,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:48:16,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:48:16,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:48:16,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:48:16,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:48:16,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:48:16,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:48:16,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:48:16,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:48:16,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:48:16,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:48:16,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 07:48:16,704 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:48:16,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:48:16,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:48:16,706 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:48:16,706 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:48:16,706 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:48:16,707 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:48:16,707 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:48:16,707 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:48:16,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:48:16,708 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:48:16,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:48:16,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:48:16,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:48:16,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:48:16,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:48:16,709 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:48:16,710 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:48:16,710 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:48:16,710 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:48:16,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:48:16,710 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:48:16,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:48:16,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:48:16,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:48:16,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:48:16,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:48:16,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:48:16,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:48:16,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:48:16,712 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:48:16,713 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:48:16,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:48:16,713 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:48:16,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:48:16,714 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/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 -> eb2d628268fd49fbaa15bffb515ab88265361c46 [2021-10-13 07:48:17,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:48:17,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:48:17,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:48:17,186 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:48:17,188 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:48:17,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/eca-rers2012/Problem10_label26.c [2021-10-13 07:48:17,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/d76f1d644/82317cbd8bc04d4cbe244fb807704e89/FLAG187232129 [2021-10-13 07:48:17,950 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:48:17,951 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/sv-benchmarks/c/eca-rers2012/Problem10_label26.c [2021-10-13 07:48:17,967 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/d76f1d644/82317cbd8bc04d4cbe244fb807704e89/FLAG187232129 [2021-10-13 07:48:18,187 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/data/d76f1d644/82317cbd8bc04d4cbe244fb807704e89 [2021-10-13 07:48:18,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:48:18,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:48:18,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:48:18,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:48:18,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:48:18,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:48:18" (1/1) ... [2021-10-13 07:48:18,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181c31fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:18, skipping insertion in model container [2021-10-13 07:48:18,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:48:18" (1/1) ... [2021-10-13 07:48:18,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:48:18,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:48:18,508 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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/sv-benchmarks/c/eca-rers2012/Problem10_label26.c[2078,2091] [2021-10-13 07:48:18,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:48:18,843 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:48:18,860 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_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/sv-benchmarks/c/eca-rers2012/Problem10_label26.c[2078,2091] [2021-10-13 07:48:19,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:48:19,023 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:48:19,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19 WrapperNode [2021-10-13 07:48:19,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:48:19,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:48:19,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:48:19,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:48:19,034 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:48:19" (1/1) ... [2021-10-13 07:48:19,079 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:48:19" (1/1) ... [2021-10-13 07:48:19,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:48:19,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:48:19,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:48:19,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:48:19,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:48:19,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:48:19,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:48:19,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:48:19,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (1/1) ... [2021-10-13 07:48:19,292 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:48:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:48:19,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:48:19,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:48:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:48:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:48:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:48:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:48:22,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:48:22,920 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 07:48:22,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:48:22 BoogieIcfgContainer [2021-10-13 07:48:22,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:48:22,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:48:22,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:48:22,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:48:22,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:48:18" (1/3) ... [2021-10-13 07:48:22,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1232cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:48:22, skipping insertion in model container [2021-10-13 07:48:22,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:19" (2/3) ... [2021-10-13 07:48:22,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1232cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:48:22, skipping insertion in model container [2021-10-13 07:48:22,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:48:22" (3/3) ... [2021-10-13 07:48:22,938 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label26.c [2021-10-13 07:48:22,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:48:22,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:48:23,021 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:48:23,027 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:48:23,027 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:48:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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:48:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:48:23,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:23,058 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:23,059 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1657508526, now seen corresponding path program 1 times [2021-10-13 07:48:23,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:48:23,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887784732] [2021-10-13 07:48:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:23,082 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:48:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:48:23,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:48:23,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:48:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:23,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:23,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:23,354 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:48:23,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:23,480 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:48:23,481 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:48:23,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887784732] [2021-10-13 07:48:23,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887784732] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:23,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:23,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:48:23,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049188914] [2021-10-13 07:48:23,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:23,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:48:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:23,527 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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:48:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:41,352 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2021-10-13 07:48:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 16 [2021-10-13 07:48:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:41,372 INFO L225 Difference]: With dead ends: 709 [2021-10-13 07:48:41,372 INFO L226 Difference]: Without dead ends: 421 [2021-10-13 07:48:41,377 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-10-13 07:48:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-10-13 07:48:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4071428571428573) internal successors, (591), 420 states have internal predecessors, (591), 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:48:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2021-10-13 07:48:41,447 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 16 [2021-10-13 07:48:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:41,448 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2021-10-13 07:48:41,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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:48:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2021-10-13 07:48:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 07:48:41,457 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:41,457 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:41,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:48:41,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:48:41,658 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash -336030316, now seen corresponding path program 1 times [2021-10-13 07:48:41,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:48:41,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423046922] [2021-10-13 07:48:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:41,662 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:48:41,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:48:41,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:48:41,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:48:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:41,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:41,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:42,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:42,566 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:48:42,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423046922] [2021-10-13 07:48:42,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423046922] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:42,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:42,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:48:42,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476296851] [2021-10-13 07:48:42,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:42,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:48:42,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:42,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:42,572 INFO L87 Difference]: Start difference. First operand 421 states and 591 transitions. Second operand has 4 states, 4 states have (on average 39.25) 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:48:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:47,763 INFO L93 Difference]: Finished difference Result 1396 states and 2008 transitions. [2021-10-13 07:48:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) 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 86 [2021-10-13 07:48:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:47,774 INFO L225 Difference]: With dead ends: 1396 [2021-10-13 07:48:47,774 INFO L226 Difference]: Without dead ends: 977 [2021-10-13 07:48:47,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-10-13 07:48:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2021-10-13 07:48:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.3488649940262845) internal successors, (1129), 837 states have internal predecessors, (1129), 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:48:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2021-10-13 07:48:47,836 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 86 [2021-10-13 07:48:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:47,837 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2021-10-13 07:48:47,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) 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:48:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2021-10-13 07:48:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-13 07:48:47,842 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:47,843 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:47,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-10-13 07:48:48,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:48:48,055 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:48,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -551599636, now seen corresponding path program 1 times [2021-10-13 07:48:48,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:48:48,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335852936] [2021-10-13 07:48:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:48,059 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:48:48,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:48:48,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:48:48,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:48:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:48,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:48,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:48,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:48,714 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:48:48,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335852936] [2021-10-13 07:48:48,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335852936] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:48,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:48,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:48:48,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275180178] [2021-10-13 07:48:48,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:48,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:48:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:48,718 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:48:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:53,575 INFO L93 Difference]: Finished difference Result 2230 states and 3074 transitions. [2021-10-13 07:48:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-10-13 07:48:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:53,584 INFO L225 Difference]: With dead ends: 2230 [2021-10-13 07:48:53,585 INFO L226 Difference]: Without dead ends: 1116 [2021-10-13 07:48:53,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2021-10-13 07:48:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2021-10-13 07:48:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3258196721311475) internal successors, (1294), 976 states have internal predecessors, (1294), 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:48:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1294 transitions. [2021-10-13 07:48:53,624 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1294 transitions. Word has length 91 [2021-10-13 07:48:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:53,625 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 1294 transitions. [2021-10-13 07:48:53,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:48:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1294 transitions. [2021-10-13 07:48:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-13 07:48:53,632 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:53,633 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-13 07:48:53,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:48:53,853 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash -777130980, now seen corresponding path program 1 times [2021-10-13 07:48:53,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:48:53,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801926550] [2021-10-13 07:48:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:53,859 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:48:53,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:48:53,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:48:53,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:48:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:54,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:54,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:54,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:55,260 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:48:55,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801926550] [2021-10-13 07:48:55,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801926550] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:55,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:55,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:48:55,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965651147] [2021-10-13 07:48:55,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:55,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:48:55,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:55,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:55,264 INFO L87 Difference]: Start difference. First operand 977 states and 1294 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 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:48:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:58,985 INFO L93 Difference]: Finished difference Result 2647 states and 3519 transitions. [2021-10-13 07:48:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 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:48:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:59,007 INFO L225 Difference]: With dead ends: 2647 [2021-10-13 07:48:59,007 INFO L226 Difference]: Without dead ends: 1811 [2021-10-13 07:48:59,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2021-10-13 07:48:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1394. [2021-10-13 07:48:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.232591529073941) internal successors, (1717), 1393 states have internal predecessors, (1717), 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:48:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1717 transitions. [2021-10-13 07:48:59,067 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1717 transitions. Word has length 134 [2021-10-13 07:48:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:59,068 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 1717 transitions. [2021-10-13 07:48:59,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 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:48:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1717 transitions. [2021-10-13 07:48:59,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-10-13 07:48:59,079 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:59,080 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:59,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:48:59,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:48:59,293 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:48:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 815462117, now seen corresponding path program 1 times [2021-10-13 07:48:59,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:48:59,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681686813] [2021-10-13 07:48:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:59,299 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:48:59,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:48:59,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:48:59,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:48:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:59,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:48:59,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:49:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:49:00,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:49:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:49:01,453 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:49:01,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681686813] [2021-10-13 07:49:01,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681686813] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:01,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:01,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:49:01,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577067981] [2021-10-13 07:49:01,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:01,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:49:01,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:01,457 INFO L87 Difference]: Start difference. First operand 1394 states and 1717 transitions. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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:49:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:05,314 INFO L93 Difference]: Finished difference Result 3203 states and 3981 transitions. [2021-10-13 07:49:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:05,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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 277 [2021-10-13 07:49:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:05,332 INFO L225 Difference]: With dead ends: 3203 [2021-10-13 07:49:05,332 INFO L226 Difference]: Without dead ends: 1950 [2021-10-13 07:49:05,334 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2021-10-13 07:49:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1811. [2021-10-13 07:49:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.2082872928176795) internal successors, (2187), 1810 states have internal predecessors, (2187), 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:49:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2187 transitions. [2021-10-13 07:49:05,396 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2187 transitions. Word has length 277 [2021-10-13 07:49:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:05,397 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 2187 transitions. [2021-10-13 07:49:05,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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:49:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2187 transitions. [2021-10-13 07:49:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2021-10-13 07:49:05,406 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:05,407 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:05,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:49:05,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:49:05,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:49:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1614484285, now seen corresponding path program 1 times [2021-10-13 07:49:05,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:49:05,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001845110] [2021-10-13 07:49:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:05,627 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:49:05,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:49:05,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:49:05,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:49:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:06,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:49:06,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:49:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 41 proven. 177 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-10-13 07:49:07,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:49:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-10-13 07:49:18,821 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:49:18,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001845110] [2021-10-13 07:49:18,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001845110] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 07:49:18,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:49:18,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-13 07:49:18,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41789315] [2021-10-13 07:49:18,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:18,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:49:18,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:18,825 INFO L87 Difference]: Start difference. First operand 1811 states and 2187 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 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:50:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:50:51,270 INFO L93 Difference]: Finished difference Result 5010 states and 6036 transitions. [2021-10-13 07:50:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:50:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 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 313 [2021-10-13 07:50:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:50:51,299 INFO L225 Difference]: With dead ends: 5010 [2021-10-13 07:50:51,300 INFO L226 Difference]: Without dead ends: 3340 [2021-10-13 07:50:51,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 386.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:50:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2021-10-13 07:50:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2784. [2021-10-13 07:50:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2783 states have (on average 1.198706431908013) internal successors, (3336), 2783 states have internal predecessors, (3336), 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:50:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3336 transitions. [2021-10-13 07:50:51,392 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3336 transitions. Word has length 313 [2021-10-13 07:50:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:50:51,393 INFO L470 AbstractCegarLoop]: Abstraction has 2784 states and 3336 transitions. [2021-10-13 07:50:51,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 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:50:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3336 transitions. [2021-10-13 07:50:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2021-10-13 07:50:51,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:50:51,404 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:50:51,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 07:50:51,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:50:51,617 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:50:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:50:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash 997509681, now seen corresponding path program 1 times [2021-10-13 07:50:51,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:50:51,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762324672] [2021-10-13 07:50:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:50:51,621 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:50:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:50:51,623 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:50:51,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:50:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:50:52,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:50:52,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:50:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 214 proven. 76 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:50:53,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:51:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 214 proven. 76 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:51:27,050 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:51:27,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762324672] [2021-10-13 07:51:27,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762324672] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:51:27,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [107246435] [2021-10-13 07:51:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:51:27,052 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:51:27,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:51:27,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:51:27,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-10-13 07:51:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:51:28,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:51:28,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:51:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 214 proven. 76 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:51:29,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:52:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 214 proven. 76 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:52:01,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [107246435] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:52:01,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796220434] [2021-10-13 07:52:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:52:01,464 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:52:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:52:01,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:52:01,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 07:52:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:52:02,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:52:02,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:52:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 214 proven. 76 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:52:04,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:52:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 214 proven. 76 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:52:36,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796220434] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:52:36,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:52:36,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 5 [2021-10-13 07:52:36,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10704007] [2021-10-13 07:52:36,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:52:36,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:52:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:52:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:52:36,473 INFO L87 Difference]: Start difference. First operand 2784 states and 3336 transitions. Second operand has 6 states, 6 states have (on average 83.0) internal successors, (498), 5 states have internal predecessors, (498), 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:54:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:54:14,016 INFO L93 Difference]: Finished difference Result 7651 states and 9176 transitions. [2021-10-13 07:54:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:54:14,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 5 states have internal predecessors, (498), 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 322 [2021-10-13 07:54:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:54:14,062 INFO L225 Difference]: With dead ends: 7651 [2021-10-13 07:54:14,063 INFO L226 Difference]: Without dead ends: 5008 [2021-10-13 07:54:14,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1927 GetRequests, 1922 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1223.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:54:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2021-10-13 07:54:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 3896. [2021-10-13 07:54:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3896 states, 3895 states have (on average 1.1709884467265725) internal successors, (4561), 3895 states have internal predecessors, (4561), 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:54:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 4561 transitions. [2021-10-13 07:54:14,215 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 4561 transitions. Word has length 322 [2021-10-13 07:54:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:54:14,216 INFO L470 AbstractCegarLoop]: Abstraction has 3896 states and 4561 transitions. [2021-10-13 07:54:14,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 5 states have internal predecessors, (498), 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:54:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 4561 transitions. [2021-10-13 07:54:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2021-10-13 07:54:14,231 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:54:14,232 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:54:14,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:14,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2021-10-13 07:54:14,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:14,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:54:14,853 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:54:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:54:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1363397704, now seen corresponding path program 1 times [2021-10-13 07:54:14,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:54:14,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211628926] [2021-10-13 07:54:14,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:54:14,858 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:54:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:54:14,859 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:54:14,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:54:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:54:16,302 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:54:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:54:16,806 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-13 07:54:16,807 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:54:16,807 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:54:16,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:17,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:54:17,017 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:54:17,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:54:17 BoogieIcfgContainer [2021-10-13 07:54:17,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:54:17,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:54:17,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:54:17,285 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:54:17,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:48:22" (3/4) ... [2021-10-13 07:54:17,287 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:54:17,566 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:54:17,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:54:17,569 INFO L168 Benchmark]: Toolchain (without parser) took 359368.34 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 34.6 MB in the beginning and 28.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 69.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:17,569 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 58.7 MB. Free memory is still 38.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:54:17,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.80 ms. Allocated memory was 58.7 MB in the beginning and 77.6 MB in the end (delta: 18.9 MB). Free memory was 34.4 MB in the beginning and 55.2 MB in the end (delta: -20.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:17,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.73 ms. Allocated memory is still 77.6 MB. Free memory was 55.2 MB in the beginning and 50.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:17,571 INFO L168 Benchmark]: Boogie Preprocessor took 97.02 ms. Allocated memory is still 77.6 MB. Free memory was 49.9 MB in the beginning and 45.7 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:54:17,572 INFO L168 Benchmark]: RCFGBuilder took 3647.86 ms. Allocated memory is still 77.6 MB. Free memory was 45.7 MB in the beginning and 30.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:17,572 INFO L168 Benchmark]: TraceAbstraction took 354354.23 ms. Allocated memory was 77.6 MB in the beginning and 104.9 MB in the end (delta: 27.3 MB). Free memory was 29.5 MB in the beginning and 40.4 MB in the end (delta: -10.9 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:17,573 INFO L168 Benchmark]: Witness Printer took 282.65 ms. Allocated memory is still 104.9 MB. Free memory was 40.4 MB in the beginning and 28.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:17,575 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.27 ms. Allocated memory is still 58.7 MB. Free memory is still 38.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 822.80 ms. Allocated memory was 58.7 MB in the beginning and 77.6 MB in the end (delta: 18.9 MB). Free memory was 34.4 MB in the beginning and 55.2 MB in the end (delta: -20.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 154.73 ms. Allocated memory is still 77.6 MB. Free memory was 55.2 MB in the beginning and 50.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.02 ms. Allocated memory is still 77.6 MB. Free memory was 49.9 MB in the beginning and 45.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3647.86 ms. Allocated memory is still 77.6 MB. Free memory was 45.7 MB in the beginning and 30.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 354354.23 ms. Allocated memory was 77.6 MB in the beginning and 104.9 MB in the end (delta: 27.3 MB). Free memory was 29.5 MB in the beginning and 40.4 MB in the end (delta: -10.9 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. * Witness Printer took 282.65 ms. Allocated memory is still 104.9 MB. Free memory was 40.4 MB in the beginning and 28.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 62]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND TRUE (((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)) [L276] a1 = ((((a1 / 5) - -367248) * 1) - 890938) [L277] a10 = 0 [L278] a19 = 10 [L280] return 26; VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=4294443639, a10=0, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND TRUE ((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14)))) [L476] a1 = (((((a1 % 299890)+ 300108) - -1) + -309315) - -309317) [L477] a10 = 1 [L478] a19 = 7 [L480] return -1; VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)) VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] reach_error() VAL [a1=76344, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 353994.1ms, OverallIterations: 8, TraceHistogramMax: 4, EmptinessCheckTime: 71.7ms, AutomataDifference: 225654.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 169 SDtfs, 1432 SDslu, 80 SDs, 0 SdLazy, 5389 SolverSat, 1247 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 211739.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3730 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1658.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3896occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 505.5ms AutomataMinimizationTime, 7 MinimizatonAttempts, 2502 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 236.3ms SsaConstructionTime, 1340.3ms SatisfiabilityAnalysisTime, 118416.1ms InterpolantComputationTime, 2227 NumberOfCodeBlocks, 2227 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 3748 ConstructedInterpolants, 0 QuantifiedInterpolants, 29522 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2397 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 2337/2970 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:54:17,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3ded35-1ca2-467b-befe-b3fbcc26e1bb/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...