./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label58.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_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/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_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label58.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/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_1215539c-32c9-4d33-81b6-b9083522f736/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 904cc5ecc7106d27ef023c34f2aa21a71a49198e ....................................................................................................................................................................................................................................................................................................................................................... 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_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/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_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label58.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/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_1215539c-32c9-4d33-81b6-b9083522f736/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 904cc5ecc7106d27ef023c34f2aa21a71a49198e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:44:53,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:44:53,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:44:53,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:44:53,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:44:53,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:44:53,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:44:53,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:44:53,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:44:53,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:44:53,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:44:53,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:44:53,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:44:53,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:44:53,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:44:53,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:44:53,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:44:53,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:44:53,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:44:53,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:44:54,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:44:54,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:44:54,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:44:54,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:44:54,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:44:54,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:44:54,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:44:54,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:44:54,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:44:54,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:44:54,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:44:54,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:44:54,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:44:54,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:44:54,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:44:54,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:44:54,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:44:54,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:44:54,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:44:54,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:44:54,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:44:54,042 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:44:54,088 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:44:54,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:44:54,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:44:54,099 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:44:54,099 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:44:54,099 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:44:54,100 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:44:54,100 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:44:54,106 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:44:54,107 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:44:54,108 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:44:54,108 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:44:54,109 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:44:54,109 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:44:54,109 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:44:54,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:44:54,110 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:44:54,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:44:54,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:44:54,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:44:54,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:44:54,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:44:54,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:44:54,112 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:44:54,112 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:44:54,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:44:54,113 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:44:54,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:44:54,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:44:54,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:44:54,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:44:54,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:44:54,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:44:54,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:44:54,116 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:44:54,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:44:54,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:44:54,117 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:44:54,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:44:54,118 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_1215539c-32c9-4d33-81b6-b9083522f736/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_1215539c-32c9-4d33-81b6-b9083522f736/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 -> 904cc5ecc7106d27ef023c34f2aa21a71a49198e [2021-10-13 07:44:54,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:44:54,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:44:54,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:44:54,419 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:44:54,420 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:44:54,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2021-10-13 07:44:54,501 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/575f6e0e5/2d80e929f1e44afba98152a239651dbc/FLAG65c0b5e4a [2021-10-13 07:44:55,105 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:44:55,105 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2021-10-13 07:44:55,147 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/575f6e0e5/2d80e929f1e44afba98152a239651dbc/FLAG65c0b5e4a [2021-10-13 07:44:55,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/575f6e0e5/2d80e929f1e44afba98152a239651dbc [2021-10-13 07:44:55,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:44:55,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:44:55,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:44:55,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:44:55,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:44:55,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:55" (1/1) ... [2021-10-13 07:44:55,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b9a453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:55, skipping insertion in model container [2021-10-13 07:44:55,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:55" (1/1) ... [2021-10-13 07:44:55,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:44:55,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:44:55,641 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_1215539c-32c9-4d33-81b6-b9083522f736/sv-benchmarks/c/eca-rers2012/Problem10_label58.c[1743,1756] [2021-10-13 07:44:55,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:44:55,892 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:44:55,927 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_1215539c-32c9-4d33-81b6-b9083522f736/sv-benchmarks/c/eca-rers2012/Problem10_label58.c[1743,1756] [2021-10-13 07:44:56,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:44:56,099 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:44:56,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56 WrapperNode [2021-10-13 07:44:56,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:44:56,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:44:56,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:44:56,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:44:56,110 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:44:56" (1/1) ... [2021-10-13 07:44:56,132 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:44:56" (1/1) ... [2021-10-13 07:44:56,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:44:56,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:44:56,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:44:56,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:44:56,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:44:56,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:44:56,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:44:56,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:44:56,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (1/1) ... [2021-10-13 07:44:56,365 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:44:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:44:56,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:44:56,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:44:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:44:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:44:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:44:56,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:45:05,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:45:05,228 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 07:45:05,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:05 BoogieIcfgContainer [2021-10-13 07:45:05,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:45:05,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:45:05,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:45:05,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:45:05,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:55" (1/3) ... [2021-10-13 07:45:05,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa9588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:05, skipping insertion in model container [2021-10-13 07:45:05,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:56" (2/3) ... [2021-10-13 07:45:05,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa9588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:05, skipping insertion in model container [2021-10-13 07:45:05,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:05" (3/3) ... [2021-10-13 07:45:05,239 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label58.c [2021-10-13 07:45:05,245 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:45:05,245 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:45:05,292 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:45:05,298 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:45:05,298 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:45:05,312 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:45:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 07:45:05,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:05,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 07:45:05,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 885161243, now seen corresponding path program 1 times [2021-10-13 07:45:05,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:05,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146309910] [2021-10-13 07:45:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:05,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:05,502 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:45:05,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:05,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146309910] [2021-10-13 07:45:05,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146309910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:05,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:05,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:45:05,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250913090] [2021-10-13 07:45:05,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:05,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:05,544 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:45:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:05,608 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2021-10-13 07:45:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:05,610 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:45:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:05,619 INFO L225 Difference]: With dead ends: 23 [2021-10-13 07:45:05,619 INFO L226 Difference]: Without dead ends: 11 [2021-10-13 07:45:05,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-13 07:45:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-10-13 07:45:05,650 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:45:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-10-13 07:45:05,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2021-10-13 07:45:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:05,653 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-10-13 07:45:05,653 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:45:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-10-13 07:45:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:45:05,654 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:05,654 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-13 07:45:05,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:45:05,655 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:05,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 775963531, now seen corresponding path program 1 times [2021-10-13 07:45:05,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:05,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494769550] [2021-10-13 07:45:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:05,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:06,154 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:45:06,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:06,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494769550] [2021-10-13 07:45:06,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494769550] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:45:06,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596328035] [2021-10-13 07:45:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:06,155 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:06,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:06,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:06,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:45:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:06,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-13 07:45:06,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:19,705 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:45:19,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:35,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:45:35,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168194640] [2021-10-13 07:45:35,856 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-10-13 07:45:35,857 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:45:35,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:45:35,867 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:45:35,867 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:45:35,900 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,902 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:45:35,903 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,904 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 07:45:35,905 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:45:35,907 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,907 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:45:35,910 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-13 07:45:35,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:35,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:35,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:35,952 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:45:35,952 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,954 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:45:35,954 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,957 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:45:35,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:45:35,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:35,976 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,978 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:35,980 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-13 07:45:35,980 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:45:35,981 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:149, output treesize:152 [2021-10-13 07:45:36,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:36,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:36,209 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:45:36,213 INFO L168 Benchmark]: Toolchain (without parser) took 40858.60 ms. Allocated memory was 102.8 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 61.5 MB in the beginning and 725.1 MB in the end (delta: -663.5 MB). Peak memory consumption was 346.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:36,214 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 102.8 MB. Free memory was 80.0 MB in the beginning and 80.0 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:45:36,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.17 ms. Allocated memory is still 102.8 MB. Free memory was 61.4 MB in the beginning and 61.8 MB in the end (delta: -434.0 kB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:36,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.56 ms. Allocated memory is still 102.8 MB. Free memory was 61.8 MB in the beginning and 53.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:36,216 INFO L168 Benchmark]: Boogie Preprocessor took 125.18 ms. Allocated memory is still 102.8 MB. Free memory was 53.8 MB in the beginning and 49.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:36,218 INFO L168 Benchmark]: RCFGBuilder took 8875.12 ms. Allocated memory was 102.8 MB in the beginning and 276.8 MB in the end (delta: 174.1 MB). Free memory was 49.0 MB in the beginning and 148.6 MB in the end (delta: -99.6 MB). Peak memory consumption was 154.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:36,219 INFO L168 Benchmark]: TraceAbstraction took 30979.03 ms. Allocated memory was 276.8 MB in the beginning and 1.1 GB in the end (delta: 836.8 MB). Free memory was 148.6 MB in the beginning and 725.1 MB in the end (delta: -576.5 MB). Peak memory consumption was 259.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:36,224 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.35 ms. Allocated memory is still 102.8 MB. Free memory was 80.0 MB in the beginning and 80.0 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 743.17 ms. Allocated memory is still 102.8 MB. Free memory was 61.4 MB in the beginning and 61.8 MB in the end (delta: -434.0 kB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.56 ms. Allocated memory is still 102.8 MB. Free memory was 61.8 MB in the beginning and 53.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 125.18 ms. Allocated memory is still 102.8 MB. Free memory was 53.8 MB in the beginning and 49.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 8875.12 ms. Allocated memory was 102.8 MB in the beginning and 276.8 MB in the end (delta: 174.1 MB). Free memory was 49.0 MB in the beginning and 148.6 MB in the end (delta: -99.6 MB). Peak memory consumption was 154.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30979.03 ms. Allocated memory was 276.8 MB in the beginning and 1.1 GB in the end (delta: 836.8 MB). Free memory was 148.6 MB in the beginning and 725.1 MB in the end (delta: -576.5 MB). Peak memory consumption was 259.2 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:45:36,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/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:45:38,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:45:38,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:45:38,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:45:38,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:45:38,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:45:38,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:45:38,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:45:38,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:45:38,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:45:38,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:45:38,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:45:38,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:45:38,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:45:38,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:45:38,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:45:38,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:45:38,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:45:38,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:45:38,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:45:38,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:45:38,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:45:38,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:45:38,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:45:38,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:45:38,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:45:38,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:45:38,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:45:38,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:45:38,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:45:38,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:45:38,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:45:38,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:45:38,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:45:38,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:45:38,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:45:38,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:45:38,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:45:38,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:45:38,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:45:38,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:45:38,802 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 07:45:38,847 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:45:38,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:45:38,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:45:38,849 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:45:38,849 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:45:38,849 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:45:38,850 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:45:38,850 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:45:38,850 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:45:38,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:45:38,853 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:45:38,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:45:38,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:45:38,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:45:38,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:45:38,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:45:38,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:45:38,854 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:45:38,854 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:45:38,855 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:45:38,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:45:38,855 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:45:38,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:45:38,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:45:38,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:45:38,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:45:38,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:38,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:45:38,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:45:38,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:45:38,857 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:45:38,858 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:38,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:45:38,858 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:45:38,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:45:38,859 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_1215539c-32c9-4d33-81b6-b9083522f736/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_1215539c-32c9-4d33-81b6-b9083522f736/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 -> 904cc5ecc7106d27ef023c34f2aa21a71a49198e [2021-10-13 07:45:39,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:45:39,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:45:39,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:45:39,254 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:45:39,255 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:45:39,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2021-10-13 07:45:39,332 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/24c0dbf32/5fe5f75d3e8d4ddc9328c4714af3b19d/FLAGc147a3345 [2021-10-13 07:45:39,934 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:45:39,935 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2021-10-13 07:45:39,959 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/24c0dbf32/5fe5f75d3e8d4ddc9328c4714af3b19d/FLAGc147a3345 [2021-10-13 07:45:40,186 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/data/24c0dbf32/5fe5f75d3e8d4ddc9328c4714af3b19d [2021-10-13 07:45:40,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:45:40,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:45:40,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:40,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:45:40,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:45:40,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f735025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40, skipping insertion in model container [2021-10-13 07:45:40,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:45:40,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:45:40,469 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_1215539c-32c9-4d33-81b6-b9083522f736/sv-benchmarks/c/eca-rers2012/Problem10_label58.c[1743,1756] [2021-10-13 07:45:40,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:40,690 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:45:40,707 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_1215539c-32c9-4d33-81b6-b9083522f736/sv-benchmarks/c/eca-rers2012/Problem10_label58.c[1743,1756] [2021-10-13 07:45:40,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:40,833 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:45:40,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40 WrapperNode [2021-10-13 07:45:40,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:40,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:40,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:45:40,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:45:40,852 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:45:40" (1/1) ... [2021-10-13 07:45:40,875 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:45:40" (1/1) ... [2021-10-13 07:45:40,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:40,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:45:40,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:45:40,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:45:40,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:45:40,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:45:40,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:45:40,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:45:40,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (1/1) ... [2021-10-13 07:45:40,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:41,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:41,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:45:41,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:45:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:45:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:45:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:45:41,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:45:44,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:45:44,094 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 07:45:44,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:44 BoogieIcfgContainer [2021-10-13 07:45:44,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:45:44,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:45:44,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:45:44,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:45:44,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:40" (1/3) ... [2021-10-13 07:45:44,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236c4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:44, skipping insertion in model container [2021-10-13 07:45:44,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:40" (2/3) ... [2021-10-13 07:45:44,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236c4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:44, skipping insertion in model container [2021-10-13 07:45:44,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:44" (3/3) ... [2021-10-13 07:45:44,107 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label58.c [2021-10-13 07:45:44,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:45:44,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:45:44,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:45:44,195 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:45:44,196 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:45:44,231 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:45:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:45:44,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:44,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:44,237 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:44,250 INFO L82 PathProgramCache]: Analyzing trace with hash -461255479, now seen corresponding path program 1 times [2021-10-13 07:45:44,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:44,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905195093] [2021-10-13 07:45:44,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:44,265 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:44,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:44,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:44,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:45:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:44,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:44,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:44,511 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:45:44,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:44,595 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:45:44,595 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:44,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905195093] [2021-10-13 07:45:44,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905195093] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:44,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:44,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:45:44,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955571752] [2021-10-13 07:45:44,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:44,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:44,625 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 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:45:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:59,724 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2021-10-13 07:45:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:59,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 13 [2021-10-13 07:45:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:59,742 INFO L225 Difference]: With dead ends: 709 [2021-10-13 07:45:59,742 INFO L226 Difference]: Without dead ends: 421 [2021-10-13 07:45:59,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-10-13 07:45:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-10-13 07:45:59,815 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:45:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2021-10-13 07:45:59,819 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 13 [2021-10-13 07:45:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:59,820 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2021-10-13 07:45:59,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:45:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2021-10-13 07:45:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-13 07:45:59,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:59,825 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:59,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:00,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:00,036 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:46:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash -342547322, now seen corresponding path program 1 times [2021-10-13 07:46:00,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:00,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494589129] [2021-10-13 07:46:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:00,040 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:00,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:00,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:00,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:46:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:00,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:46:00,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:00,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:00,848 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:00,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494589129] [2021-10-13 07:46:00,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494589129] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:46:00,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:46:00,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:46:00,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768793531] [2021-10-13 07:46:00,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:46:00,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:46:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:00,852 INFO L87 Difference]: Start difference. First operand 421 states and 591 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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:46:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:05,289 INFO L93 Difference]: Finished difference Result 1396 states and 2008 transitions. [2021-10-13 07:46:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:46:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-10-13 07:46:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:05,298 INFO L225 Difference]: With dead ends: 1396 [2021-10-13 07:46:05,298 INFO L226 Difference]: Without dead ends: 977 [2021-10-13 07:46:05,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 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:46:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-10-13 07:46:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2021-10-13 07:46:05,350 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:46:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2021-10-13 07:46:05,355 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 83 [2021-10-13 07:46:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:05,356 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2021-10-13 07:46:05,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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:46:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2021-10-13 07:46:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 07:46:05,360 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:05,360 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:05,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:05,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:05,572 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:46:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1580554992, now seen corresponding path program 1 times [2021-10-13 07:46:05,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:05,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447583567] [2021-10-13 07:46:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:05,575 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:05,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:05,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:05,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:46:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:05,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:46:05,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:05,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:06,109 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:06,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447583567] [2021-10-13 07:46:06,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447583567] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:46:06,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:46:06,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:46:06,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324240734] [2021-10-13 07:46:06,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:46:06,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:06,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:46:06,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:06,112 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:46:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:10,034 INFO L93 Difference]: Finished difference Result 2091 states and 2915 transitions. [2021-10-13 07:46:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:46:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 88 [2021-10-13 07:46:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:10,043 INFO L225 Difference]: With dead ends: 2091 [2021-10-13 07:46:10,044 INFO L226 Difference]: Without dead ends: 1394 [2021-10-13 07:46:10,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-10-13 07:46:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2021-10-13 07:46:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.3201722900215362) internal successors, (1839), 1393 states have internal predecessors, (1839), 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:46:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1839 transitions. [2021-10-13 07:46:10,087 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1839 transitions. Word has length 88 [2021-10-13 07:46:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:10,088 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 1839 transitions. [2021-10-13 07:46:10,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:46:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1839 transitions. [2021-10-13 07:46:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 07:46:10,093 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:10,093 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:10,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:10,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:10,305 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:46:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 963411512, now seen corresponding path program 1 times [2021-10-13 07:46:10,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:10,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518817536] [2021-10-13 07:46:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:10,308 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:10,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:10,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:10,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:46:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:10,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:46:10,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:10,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:11,237 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:11,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518817536] [2021-10-13 07:46:11,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518817536] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:46:11,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:46:11,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:46:11,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308709721] [2021-10-13 07:46:11,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:46:11,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:46:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:11,240 INFO L87 Difference]: Start difference. First operand 1394 states and 1839 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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:46:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:15,146 INFO L93 Difference]: Finished difference Result 4176 states and 5507 transitions. [2021-10-13 07:46:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:46:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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 104 [2021-10-13 07:46:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:15,163 INFO L225 Difference]: With dead ends: 4176 [2021-10-13 07:46:15,164 INFO L226 Difference]: Without dead ends: 2923 [2021-10-13 07:46:15,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2021-10-13 07:46:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1950. [2021-10-13 07:46:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.198050282195998) internal successors, (2335), 1949 states have internal predecessors, (2335), 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:46:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2335 transitions. [2021-10-13 07:46:15,228 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2335 transitions. Word has length 104 [2021-10-13 07:46:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:15,228 INFO L470 AbstractCegarLoop]: Abstraction has 1950 states and 2335 transitions. [2021-10-13 07:46:15,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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:46:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2335 transitions. [2021-10-13 07:46:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-10-13 07:46:15,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:15,237 INFO L512 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:15,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:15,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:15,462 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:46:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash 143010852, now seen corresponding path program 1 times [2021-10-13 07:46:15,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:15,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900153721] [2021-10-13 07:46:15,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:15,466 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:15,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:15,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:46:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:15,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:46:15,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:17,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:21,225 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:21,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900153721] [2021-10-13 07:46:21,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900153721] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:21,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783710117] [2021-10-13 07:46:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:21,226 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:46:21,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:46:21,230 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:46:21,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-10-13 07:46:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:21,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 07:46:21,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:24,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:27,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [783710117] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:27,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562304617] [2021-10-13 07:46:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:27,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:46:27,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:46:27,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:46:27,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 07:46:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:28,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 07:46:28,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:29,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:46:30,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562304617] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:30,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:46:30,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8, 8, 4, 4] total 20 [2021-10-13 07:46:30,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994638348] [2021-10-13 07:46:30,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-13 07:46:30,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-13 07:46:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-13 07:46:30,762 INFO L87 Difference]: Start difference. First operand 1950 states and 2335 transitions. Second operand has 20 states, 20 states have (on average 40.25) internal successors, (805), 20 states have internal predecessors, (805), 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:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:32,668 INFO L93 Difference]: Finished difference Result 5187 states and 6218 transitions. [2021-10-13 07:47:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 07:47:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 40.25) internal successors, (805), 20 states have internal predecessors, (805), 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 225 [2021-10-13 07:47:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:32,682 INFO L225 Difference]: With dead ends: 5187 [2021-10-13 07:47:32,682 INFO L226 Difference]: Without dead ends: 2645 [2021-10-13 07:47:32,686 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1366 GetRequests, 1337 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2928.9ms TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2021-10-13 07:47:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2021-10-13 07:47:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1950. [2021-10-13 07:47:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.124679322729605) internal successors, (2192), 1949 states have internal predecessors, (2192), 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:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2192 transitions. [2021-10-13 07:47:32,741 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2192 transitions. Word has length 225 [2021-10-13 07:47:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:32,741 INFO L470 AbstractCegarLoop]: Abstraction has 1950 states and 2192 transitions. [2021-10-13 07:47:32,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 40.25) internal successors, (805), 20 states have internal predecessors, (805), 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:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2192 transitions. [2021-10-13 07:47:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-10-13 07:47:32,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:32,748 INFO L512 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:47:32,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:32,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:33,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:33,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:33,364 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:47:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2034481354, now seen corresponding path program 1 times [2021-10-13 07:47:33,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:47:33,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038704446] [2021-10-13 07:47:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:33,367 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:47:33,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:47:33,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:47:33,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:47:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:34,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:47:34,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:47:35,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:47:57,588 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:47:57,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038704446] [2021-10-13 07:47:57,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038704446] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:47:57,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2040233308] [2021-10-13 07:47:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:57,589 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:47:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:47:57,590 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:47:57,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-10-13 07:47:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:59,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:47:59,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:00,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:48:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:35,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2040233308] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:48:35,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870325817] [2021-10-13 07:48:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:35,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:48:35,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:48:35,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:48:35,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 07:48:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:36,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:48:36,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:48:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:37,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:49:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:09,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870325817] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:49:09,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:49:09,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 9 [2021-10-13 07:49:09,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593990790] [2021-10-13 07:49:09,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:49:09,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:49:09,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:49:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:49:09,383 INFO L87 Difference]: Start difference. First operand 1950 states and 2192 transitions. Second operand has 10 states, 10 states have (on average 77.0) internal successors, (770), 9 states have internal predecessors, (770), 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:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:54:10,405 INFO L93 Difference]: Finished difference Result 7375 states and 8300 transitions. [2021-10-13 07:54:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 07:54:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 77.0) internal successors, (770), 9 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2021-10-13 07:54:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:54:10,446 INFO L225 Difference]: With dead ends: 7375 [2021-10-13 07:54:10,446 INFO L226 Difference]: Without dead ends: 5149 [2021-10-13 07:54:10,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1565 GetRequests, 1552 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8151.1ms TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2021-10-13 07:54:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5149 states. [2021-10-13 07:54:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5149 to 3062. [2021-10-13 07:54:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3061 states have (on average 1.128062724599804) internal successors, (3453), 3061 states have internal predecessors, (3453), 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:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 3453 transitions. [2021-10-13 07:54:10,560 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 3453 transitions. Word has length 261 [2021-10-13 07:54:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:54:10,561 INFO L470 AbstractCegarLoop]: Abstraction has 3062 states and 3453 transitions. [2021-10-13 07:54:10,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.0) internal successors, (770), 9 states have internal predecessors, (770), 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:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 3453 transitions. [2021-10-13 07:54:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2021-10-13 07:54:10,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:54:10,571 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:54:10,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:10,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-10-13 07:54:10,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:11,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:54:11,187 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:54:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:54:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 123961231, now seen corresponding path program 1 times [2021-10-13 07:54:11,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:54:11,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75969973] [2021-10-13 07:54:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:54:11,191 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:54:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:54:11,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:54:11,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 07:54:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:54:12,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:54:12,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:54:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-10-13 07:54:13,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:54:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-10-13 07:54:15,468 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:54:15,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75969973] [2021-10-13 07:54:15,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75969973] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:54:15,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:54:15,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:54:15,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324074382] [2021-10-13 07:54:15,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:54:15,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:54:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:54:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:54:15,471 INFO L87 Difference]: Start difference. First operand 3062 states and 3453 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:54:18,638 INFO L93 Difference]: Finished difference Result 5427 states and 6133 transitions. [2021-10-13 07:54:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:54:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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 342 [2021-10-13 07:54:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:54:18,654 INFO L225 Difference]: With dead ends: 5427 [2021-10-13 07:54:18,655 INFO L226 Difference]: Without dead ends: 2923 [2021-10-13 07:54:18,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:54:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2021-10-13 07:54:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2645. [2021-10-13 07:54:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1183812405446294) internal successors, (2957), 2644 states have internal predecessors, (2957), 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:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 2957 transitions. [2021-10-13 07:54:18,721 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 2957 transitions. Word has length 342 [2021-10-13 07:54:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:54:18,722 INFO L470 AbstractCegarLoop]: Abstraction has 2645 states and 2957 transitions. [2021-10-13 07:54:18,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 2957 transitions. [2021-10-13 07:54:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2021-10-13 07:54:18,740 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:54:18,741 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:54:18,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:18,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:54:18,956 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:54:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:54:18,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1365207174, now seen corresponding path program 1 times [2021-10-13 07:54:18,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:54:18,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983241060] [2021-10-13 07:54:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:54:18,959 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:54:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:54:18,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:54:18,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 07:54:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:54:20,521 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:54:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:54:20,939 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-13 07:54:20,939 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:54:20,940 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:54:20,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 07:54:21,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:54:21,149 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:54:21,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:54:21 BoogieIcfgContainer [2021-10-13 07:54:21,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:54:21,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:54:21,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:54:21,394 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:54:21,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:44" (3/4) ... [2021-10-13 07:54:21,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:54:21,676 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:54:21,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:54:21,679 INFO L168 Benchmark]: Toolchain (without parser) took 521480.90 ms. Allocated memory was 69.2 MB in the beginning and 134.2 MB in the end (delta: 65.0 MB). Free memory was 46.8 MB in the beginning and 54.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:21,679 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 69.2 MB. Free memory is still 49.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:54:21,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.17 ms. Allocated memory is still 69.2 MB. Free memory was 46.7 MB in the beginning and 30.1 MB in the end (delta: 16.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:21,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.77 ms. Allocated memory is still 69.2 MB. Free memory was 30.1 MB in the beginning and 46.0 MB in the end (delta: -15.9 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:21,681 INFO L168 Benchmark]: Boogie Preprocessor took 64.55 ms. Allocated memory is still 69.2 MB. Free memory was 46.0 MB in the beginning and 41.8 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:21,681 INFO L168 Benchmark]: RCFGBuilder took 3109.09 ms. Allocated memory was 69.2 MB in the beginning and 88.1 MB in the end (delta: 18.9 MB). Free memory was 41.8 MB in the beginning and 50.0 MB in the end (delta: -8.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:21,681 INFO L168 Benchmark]: TraceAbstraction took 517291.81 ms. Allocated memory was 88.1 MB in the beginning and 134.2 MB in the end (delta: 46.1 MB). Free memory was 49.7 MB in the beginning and 65.7 MB in the end (delta: -15.9 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:21,682 INFO L168 Benchmark]: Witness Printer took 283.43 ms. Allocated memory is still 134.2 MB. Free memory was 65.7 MB in the beginning and 54.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:54:21,685 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.29 ms. Allocated memory is still 69.2 MB. Free memory is still 49.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 636.17 ms. Allocated memory is still 69.2 MB. Free memory was 46.7 MB in the beginning and 30.1 MB in the end (delta: 16.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 88.77 ms. Allocated memory is still 69.2 MB. Free memory was 30.1 MB in the beginning and 46.0 MB in the end (delta: -15.9 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.55 ms. Allocated memory is still 69.2 MB. Free memory was 46.0 MB in the beginning and 41.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3109.09 ms. Allocated memory was 69.2 MB in the beginning and 88.1 MB in the end (delta: 18.9 MB). Free memory was 41.8 MB in the beginning and 50.0 MB in the end (delta: -8.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 517291.81 ms. Allocated memory was 88.1 MB in the beginning and 134.2 MB in the end (delta: 46.1 MB). Free memory was 49.7 MB in the beginning and 65.7 MB in the end (delta: -15.9 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.1 GB. * Witness Printer took 283.43 ms. Allocated memory is still 134.2 MB. Free memory was 65.7 MB in the beginning and 54.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 29.1 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: 53]: 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 FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (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] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (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] [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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, 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=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L471] a1 = (((a1 / 5) + 105416) + 61704) [L472] a10 = 4 [L474] return 24; VAL [a1=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, 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=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND TRUE ((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))) [L324] a19 = 8 [L326] return -1; VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, 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=167153, a10=4, a12=0, a19=8, 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=167153, a10=4, a12=0, a19=8, 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=167153, a10=4, a12=0, a19=8, 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=167153, a10=4, a12=0, a19=8, 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=167153, a10=4, a12=0, a19=8, 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=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] reach_error() VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 516961.2ms, OverallIterations: 8, TraceHistogramMax: 5, EmptinessCheckTime: 71.5ms, AutomataDifference: 393634.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 167 SDtfs, 4848 SDslu, 182 SDs, 0 SdLazy, 9935 SolverSat, 2009 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 361156.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4181 GetRequests, 4129 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 11138.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3062occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 440.8ms AutomataMinimizationTime, 7 MinimizatonAttempts, 4172 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 216.7ms SsaConstructionTime, 1256.2ms SatisfiabilityAnalysisTime, 110713.0ms InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 4154 ConstructedInterpolants, 0 QuantifiedInterpolants, 30388 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2682 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 1350/2400 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:21,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1215539c-32c9-4d33-81b6-b9083522f736/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...