./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs --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 ff6d9bcceb1d1352db8389ab524f7196e6eb20f1 ....................................................................................................................................................................................................................................................................................................................................................... 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs --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 ff6d9bcceb1d1352db8389ab524f7196e6eb20f1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 03:01:39,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 03:01:39,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 03:01:39,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 03:01:39,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 03:01:39,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 03:01:39,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 03:01:39,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 03:01:39,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 03:01:39,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 03:01:39,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 03:01:39,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 03:01:39,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 03:01:39,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 03:01:39,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 03:01:39,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 03:01:39,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 03:01:39,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 03:01:39,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 03:01:39,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 03:01:39,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 03:01:39,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 03:01:39,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 03:01:39,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 03:01:39,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 03:01:39,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 03:01:39,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 03:01:39,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 03:01:39,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 03:01:39,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 03:01:39,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 03:01:39,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 03:01:39,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 03:01:39,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 03:01:40,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 03:01:40,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 03:01:40,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 03:01:40,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 03:01:40,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 03:01:40,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 03:01:40,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 03:01:40,006 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-16 03:01:40,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 03:01:40,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 03:01:40,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 03:01:40,058 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 03:01:40,059 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 03:01:40,059 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 03:01:40,060 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 03:01:40,060 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 03:01:40,060 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 03:01:40,060 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 03:01:40,062 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 03:01:40,062 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 03:01:40,063 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 03:01:40,063 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 03:01:40,063 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 03:01:40,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 03:01:40,064 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 03:01:40,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 03:01:40,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 03:01:40,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 03:01:40,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 03:01:40,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 03:01:40,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 03:01:40,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 03:01:40,077 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 03:01:40,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 03:01:40,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 03:01:40,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 03:01:40,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 03:01:40,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 03:01:40,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:01:40,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 03:01:40,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 03:01:40,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 03:01:40,083 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 03:01:40,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 03:01:40,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 03:01:40,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 03:01:40,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 03:01:40,085 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/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_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs 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 -> ff6d9bcceb1d1352db8389ab524f7196e6eb20f1 [2021-10-16 03:01:40,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 03:01:40,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 03:01:40,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 03:01:40,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 03:01:40,411 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 03:01:40,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem10_label50.c [2021-10-16 03:01:40,516 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/cc91e57b3/18359bc60bff491da001aa7d67e5d7e9/FLAGa6524885c [2021-10-16 03:01:41,114 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 03:01:41,115 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/sv-benchmarks/c/eca-rers2012/Problem10_label50.c [2021-10-16 03:01:41,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/cc91e57b3/18359bc60bff491da001aa7d67e5d7e9/FLAGa6524885c [2021-10-16 03:01:41,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/cc91e57b3/18359bc60bff491da001aa7d67e5d7e9 [2021-10-16 03:01:41,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 03:01:41,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 03:01:41,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 03:01:41,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 03:01:41,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 03:01:41,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:41,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3242a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41, skipping insertion in model container [2021-10-16 03:01:41,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:41,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 03:01:41,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 03:01:41,625 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/sv-benchmarks/c/eca-rers2012/Problem10_label50.c[1307,1320] [2021-10-16 03:01:41,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:01:41,856 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 03:01:41,870 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/sv-benchmarks/c/eca-rers2012/Problem10_label50.c[1307,1320] [2021-10-16 03:01:41,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:01:41,964 INFO L208 MainTranslator]: Completed translation [2021-10-16 03:01:41,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41 WrapperNode [2021-10-16 03:01:41,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 03:01:41,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 03:01:41,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 03:01:41,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 03:01:41,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:41,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 03:01:42,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 03:01:42,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 03:01:42,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 03:01:42,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 03:01:42,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 03:01:42,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 03:01:42,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 03:01:42,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (1/1) ... [2021-10-16 03:01:42,177 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:01:42,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:01:42,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 03:01:42,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 03:01:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 03:01:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 03:01:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 03:01:42,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 03:01:50,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 03:01:50,664 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 03:01:50,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:01:50 BoogieIcfgContainer [2021-10-16 03:01:50,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 03:01:50,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 03:01:50,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 03:01:50,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 03:01:50,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 03:01:41" (1/3) ... [2021-10-16 03:01:50,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae2245d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:01:50, skipping insertion in model container [2021-10-16 03:01:50,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:01:41" (2/3) ... [2021-10-16 03:01:50,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae2245d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:01:50, skipping insertion in model container [2021-10-16 03:01:50,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:01:50" (3/3) ... [2021-10-16 03:01:50,693 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2021-10-16 03:01:50,698 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 03:01:50,699 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 03:01:50,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 03:01:50,753 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-16 03:01:50,753 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 03:01:50,770 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-16 03:01:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-16 03:01:50,776 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:01:50,777 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-16 03:01:50,777 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:01:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:01:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash 885115052, now seen corresponding path program 1 times [2021-10-16 03:01:50,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:01:50,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500477832] [2021-10-16 03:01:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:01:50,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:01:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:01:51,060 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-16 03:01:51,061 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:01:51,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500477832] [2021-10-16 03:01:51,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500477832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:01:51,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:01:51,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 03:01:51,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684824084] [2021-10-16 03:01:51,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:01:51,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:01:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:01:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 03:01:51,089 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-16 03:01:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:01:51,168 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2021-10-16 03:01:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:01:51,171 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-16 03:01:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:01:51,183 INFO L225 Difference]: With dead ends: 23 [2021-10-16 03:01:51,183 INFO L226 Difference]: Without dead ends: 11 [2021-10-16 03:01:51,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 03:01:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-16 03:01:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-10-16 03:01:51,218 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-16 03:01:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-10-16 03:01:51,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2021-10-16 03:01:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:01:51,222 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-10-16 03:01:51,222 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-16 03:01:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-10-16 03:01:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 03:01:51,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:01:51,223 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-16 03:01:51,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 03:01:51,225 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:01:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:01:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1096784461, now seen corresponding path program 1 times [2021-10-16 03:01:51,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:01:51,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921695652] [2021-10-16 03:01:51,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:01:51,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:01:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:01:51,888 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-16 03:01:51,888 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:01:51,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921695652] [2021-10-16 03:01:51,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921695652] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 03:01:51,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592146398] [2021-10-16 03:01:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:01:51,891 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:01:51,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:01:51,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 03:01:51,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 03:01:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:01:52,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 03:01:52,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:02:06,944 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-16 03:02:06,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:02:28,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 03:02:28,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791689191] [2021-10-16 03:02:28,664 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-10-16 03:02:28,664 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 03:02:28,673 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 03:02:28,677 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 03:02:28,677 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 03:02:28,707 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,710 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 03:02:28,711 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,712 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-16 03:02:28,713 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 03:02:28,713 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,714 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 03:02:28,716 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-16 03:02:28,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 03:02:28,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 03:02:28,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 03:02:28,771 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-16 03:02:28,772 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,774 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 03:02:28,775 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,777 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 03:02:28,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 03:02:28,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 03:02:28,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,803 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:28,806 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-16 03:02:28,806 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 03:02:28,807 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:149, output treesize:152 [2021-10-16 03:02:28,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:29,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:02:29,033 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-16 03:02:29,037 INFO L168 Benchmark]: Toolchain (without parser) took 47672.81 ms. Allocated memory was 94.4 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 70.4 MB in the beginning and 760.8 MB in the end (delta: -690.4 MB). Peak memory consumption was 646.5 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:29,038 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 68.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 03:02:29,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.98 ms. Allocated memory is still 94.4 MB. Free memory was 70.1 MB in the beginning and 52.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:29,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.19 ms. Allocated memory is still 94.4 MB. Free memory was 52.9 MB in the beginning and 44.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:29,040 INFO L168 Benchmark]: Boogie Preprocessor took 99.99 ms. Allocated memory is still 94.4 MB. Free memory was 44.8 MB in the beginning and 39.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:29,040 INFO L168 Benchmark]: RCFGBuilder took 8501.39 ms. Allocated memory was 94.4 MB in the beginning and 444.6 MB in the end (delta: 350.2 MB). Free memory was 39.9 MB in the beginning and 368.4 MB in the end (delta: -328.5 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:29,041 INFO L168 Benchmark]: TraceAbstraction took 38366.59 ms. Allocated memory was 444.6 MB in the beginning and 1.4 GB in the end (delta: 987.8 MB). Free memory was 367.4 MB in the beginning and 760.8 MB in the end (delta: -393.4 MB). Peak memory consumption was 593.3 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:29,044 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 68.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 599.98 ms. Allocated memory is still 94.4 MB. Free memory was 70.1 MB in the beginning and 52.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.19 ms. Allocated memory is still 94.4 MB. Free memory was 52.9 MB in the beginning and 44.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 99.99 ms. Allocated memory is still 94.4 MB. Free memory was 44.8 MB in the beginning and 39.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 8501.39 ms. Allocated memory was 94.4 MB in the beginning and 444.6 MB in the end (delta: 350.2 MB). Free memory was 39.9 MB in the beginning and 368.4 MB in the end (delta: -328.5 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 38366.59 ms. Allocated memory was 444.6 MB in the beginning and 1.4 GB in the end (delta: 987.8 MB). Free memory was 367.4 MB in the beginning and 760.8 MB in the end (delta: -393.4 MB). Peak memory consumption was 593.3 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-16 03:02:29,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/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-5709675 [2021-10-16 03:02:31,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 03:02:31,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 03:02:31,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 03:02:31,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 03:02:31,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 03:02:31,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 03:02:31,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 03:02:31,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 03:02:31,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 03:02:31,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 03:02:31,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 03:02:31,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 03:02:31,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 03:02:31,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 03:02:31,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 03:02:31,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 03:02:31,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 03:02:31,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 03:02:31,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 03:02:31,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 03:02:31,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 03:02:31,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 03:02:31,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 03:02:31,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 03:02:31,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 03:02:31,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 03:02:31,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 03:02:31,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 03:02:31,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 03:02:31,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 03:02:31,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 03:02:31,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 03:02:31,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 03:02:31,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 03:02:31,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 03:02:31,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 03:02:31,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 03:02:31,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 03:02:31,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 03:02:31,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 03:02:31,574 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-16 03:02:31,629 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 03:02:31,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 03:02:31,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 03:02:31,631 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 03:02:31,631 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 03:02:31,632 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 03:02:31,632 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 03:02:31,632 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 03:02:31,632 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 03:02:31,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 03:02:31,635 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 03:02:31,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 03:02:31,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 03:02:31,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 03:02:31,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 03:02:31,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 03:02:31,637 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 03:02:31,637 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 03:02:31,637 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 03:02:31,637 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 03:02:31,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 03:02:31,638 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 03:02:31,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 03:02:31,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 03:02:31,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 03:02:31,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 03:02:31,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:02:31,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 03:02:31,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 03:02:31,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 03:02:31,640 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 03:02:31,640 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 03:02:31,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 03:02:31,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 03:02:31,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 03:02:31,642 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/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_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs 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 -> ff6d9bcceb1d1352db8389ab524f7196e6eb20f1 [2021-10-16 03:02:32,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 03:02:32,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 03:02:32,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 03:02:32,095 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 03:02:32,096 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 03:02:32,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem10_label50.c [2021-10-16 03:02:32,182 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/98c6e0afb/e501070dcbf94de99d08ce225f95a967/FLAG569b6f137 [2021-10-16 03:02:32,844 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 03:02:32,844 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/sv-benchmarks/c/eca-rers2012/Problem10_label50.c [2021-10-16 03:02:32,858 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/98c6e0afb/e501070dcbf94de99d08ce225f95a967/FLAG569b6f137 [2021-10-16 03:02:33,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/data/98c6e0afb/e501070dcbf94de99d08ce225f95a967 [2021-10-16 03:02:33,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 03:02:33,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 03:02:33,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 03:02:33,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 03:02:33,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 03:02:33,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45611ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33, skipping insertion in model container [2021-10-16 03:02:33,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 03:02:33,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 03:02:33,346 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/sv-benchmarks/c/eca-rers2012/Problem10_label50.c[1307,1320] [2021-10-16 03:02:33,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:02:33,638 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 03:02:33,652 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_9e62a427-d2b0-489c-871e-6a8ab25f3748/sv-benchmarks/c/eca-rers2012/Problem10_label50.c[1307,1320] [2021-10-16 03:02:33,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:02:33,865 INFO L208 MainTranslator]: Completed translation [2021-10-16 03:02:33,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33 WrapperNode [2021-10-16 03:02:33,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 03:02:33,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 03:02:33,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 03:02:33,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 03:02:33,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 03:02:33,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 03:02:33,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 03:02:33,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 03:02:33,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:33,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:34,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:34,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:34,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:34,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 03:02:34,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 03:02:34,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 03:02:34,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 03:02:34,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (1/1) ... [2021-10-16 03:02:34,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:02:34,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:02:34,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 03:02:34,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 03:02:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 03:02:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 03:02:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 03:02:34,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 03:02:37,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 03:02:37,187 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 03:02:37,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:02:37 BoogieIcfgContainer [2021-10-16 03:02:37,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 03:02:37,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 03:02:37,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 03:02:37,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 03:02:37,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 03:02:33" (1/3) ... [2021-10-16 03:02:37,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea7113a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:02:37, skipping insertion in model container [2021-10-16 03:02:37,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:33" (2/3) ... [2021-10-16 03:02:37,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea7113a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:02:37, skipping insertion in model container [2021-10-16 03:02:37,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:02:37" (3/3) ... [2021-10-16 03:02:37,200 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2021-10-16 03:02:37,208 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 03:02:37,209 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 03:02:37,280 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 03:02:37,288 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-16 03:02:37,289 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 03:02:37,321 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-16 03:02:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 03:02:37,341 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:02:37,342 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:02:37,342 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:02:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:02:37,348 INFO L82 PathProgramCache]: Analyzing trace with hash 647015545, now seen corresponding path program 1 times [2021-10-16 03:02:37,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:02:37,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266490634] [2021-10-16 03:02:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:02:37,361 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:02:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:02:37,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:02:37,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 03:02:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:02:37,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:02:37,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:02:37,580 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-16 03:02:37,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:02:37,651 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-16 03:02:37,652 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:02:37,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266490634] [2021-10-16 03:02:37,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266490634] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:02:37,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:02:37,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 03:02:37,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136211961] [2021-10-16 03:02:37,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:02:37,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:02:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:02:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:02:37,684 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 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-16 03:02:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:02:52,917 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2021-10-16 03:02:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:02:52,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 9 [2021-10-16 03:02:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:02:52,935 INFO L225 Difference]: With dead ends: 709 [2021-10-16 03:02:52,935 INFO L226 Difference]: Without dead ends: 421 [2021-10-16 03:02:52,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:02:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-10-16 03:02:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-10-16 03:02:53,002 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-16 03:02:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 591 transitions. [2021-10-16 03:02:53,006 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 591 transitions. Word has length 9 [2021-10-16 03:02:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:02:53,006 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 591 transitions. [2021-10-16 03:02:53,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-16 03:02:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 591 transitions. [2021-10-16 03:02:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-16 03:02:53,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:02:53,011 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:02:53,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:53,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:02:53,217 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:02:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:02:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1467990774, now seen corresponding path program 1 times [2021-10-16 03:02:53,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:02:53,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251430645] [2021-10-16 03:02:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:02:53,225 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:02:53,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:02:53,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:02:53,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 03:02:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:02:53,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:02:53,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:02:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:02:53,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:02:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:02:54,051 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:02:54,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251430645] [2021-10-16 03:02:54,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251430645] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:02:54,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:02:54,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 03:02:54,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835939766] [2021-10-16 03:02:54,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:02:54,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:02:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:02:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:02:54,055 INFO L87 Difference]: Start difference. First operand 421 states and 591 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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-16 03:02:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:02:58,661 INFO L93 Difference]: Finished difference Result 1396 states and 2008 transitions. [2021-10-16 03:02:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:02:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-10-16 03:02:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:02:58,674 INFO L225 Difference]: With dead ends: 1396 [2021-10-16 03:02:58,674 INFO L226 Difference]: Without dead ends: 977 [2021-10-16 03:02:58,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:02:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-10-16 03:02:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2021-10-16 03:02:58,732 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-16 03:02:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2021-10-16 03:02:58,737 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 79 [2021-10-16 03:02:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:02:58,738 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2021-10-16 03:02:58,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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-16 03:02:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2021-10-16 03:02:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-16 03:02:58,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:02:58,743 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:02:58,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:58,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:02:58,956 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:02:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:02:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 422285312, now seen corresponding path program 1 times [2021-10-16 03:02:58,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:02:58,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582159518] [2021-10-16 03:02:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:02:58,959 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:02:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:02:58,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:02:58,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 03:02:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:02:59,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:02:59,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:02:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:02:59,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:02:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:02:59,542 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:02:59,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582159518] [2021-10-16 03:02:59,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582159518] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:02:59,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:02:59,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 03:02:59,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085486924] [2021-10-16 03:02:59,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:02:59,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:02:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:02:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:02:59,547 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-16 03:03:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:03,929 INFO L93 Difference]: Finished difference Result 2091 states and 2915 transitions. [2021-10-16 03:03:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:03,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 84 [2021-10-16 03:03:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:03,943 INFO L225 Difference]: With dead ends: 2091 [2021-10-16 03:03:03,943 INFO L226 Difference]: Without dead ends: 1394 [2021-10-16 03:03:03,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-10-16 03:03:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2021-10-16 03:03:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.32735104091888) internal successors, (1849), 1393 states have internal predecessors, (1849), 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-16 03:03:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1849 transitions. [2021-10-16 03:03:03,995 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1849 transitions. Word has length 84 [2021-10-16 03:03:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:03,997 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 1849 transitions. [2021-10-16 03:03:03,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-16 03:03:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1849 transitions. [2021-10-16 03:03:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-10-16 03:03:04,015 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:04,015 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:03:04,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-16 03:03:04,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:04,228 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1415146810, now seen corresponding path program 1 times [2021-10-16 03:03:04,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:04,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258883539] [2021-10-16 03:03:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:04,234 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:04,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:04,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:04,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 03:03:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:04,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:03:04,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:04,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:06,101 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:06,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258883539] [2021-10-16 03:03:06,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258883539] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:06,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:06,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 03:03:06,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238860312] [2021-10-16 03:03:06,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:06,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:06,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:06,104 INFO L87 Difference]: Start difference. First operand 1394 states and 1849 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-16 03:03:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:10,240 INFO L93 Difference]: Finished difference Result 2647 states and 3547 transitions. [2021-10-16 03:03:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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 168 [2021-10-16 03:03:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:10,252 INFO L225 Difference]: With dead ends: 2647 [2021-10-16 03:03:10,253 INFO L226 Difference]: Without dead ends: 1394 [2021-10-16 03:03:10,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-10-16 03:03:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2021-10-16 03:03:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.2519741564967695) internal successors, (1744), 1393 states have internal predecessors, (1744), 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-16 03:03:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1744 transitions. [2021-10-16 03:03:10,292 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1744 transitions. Word has length 168 [2021-10-16 03:03:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:10,293 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 1744 transitions. [2021-10-16 03:03:10,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-16 03:03:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1744 transitions. [2021-10-16 03:03:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-16 03:03:10,296 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:10,297 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:03:10,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-16 03:03:10,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:10,510 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash 711637950, now seen corresponding path program 1 times [2021-10-16 03:03:10,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:10,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518613086] [2021-10-16 03:03:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:10,512 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:10,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:10,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 03:03:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:10,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-16 03:03:10,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:12,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:16,931 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:16,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518613086] [2021-10-16 03:03:16,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518613086] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:03:16,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [775474049] [2021-10-16 03:03:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:16,933 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 03:03:16,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 03:03:16,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 03:03:16,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-10-16 03:03:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:17,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-16 03:03:17,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-16 03:03:19,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-10-16 03:03:19,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [775474049] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:03:19,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-16 03:03:19,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 6] total 11 [2021-10-16 03:03:19,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493399222] [2021-10-16 03:03:19,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:03:19,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:03:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-10-16 03:03:19,961 INFO L87 Difference]: Start difference. First operand 1394 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:22,762 INFO L93 Difference]: Finished difference Result 2230 states and 2770 transitions. [2021-10-16 03:03:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:03:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-10-16 03:03:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:22,799 INFO L225 Difference]: With dead ends: 2230 [2021-10-16 03:03:22,799 INFO L226 Difference]: Without dead ends: 2228 [2021-10-16 03:03:22,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 505.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-10-16 03:03:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2021-10-16 03:03:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1394. [2021-10-16 03:03:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.2519741564967695) internal successors, (1744), 1393 states have internal predecessors, (1744), 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-16 03:03:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1744 transitions. [2021-10-16 03:03:22,843 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1744 transitions. Word has length 179 [2021-10-16 03:03:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:22,844 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 1744 transitions. [2021-10-16 03:03:22,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1744 transitions. [2021-10-16 03:03:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-16 03:03:22,849 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:22,850 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:03:22,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:23,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:23,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt [2021-10-16 03:03:23,262 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash 309661583, now seen corresponding path program 1 times [2021-10-16 03:03:23,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:23,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905369154] [2021-10-16 03:03:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:23,264 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:23,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:23,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 03:03:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:23,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:03:23,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 03:03:24,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 03:03:25,357 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:25,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905369154] [2021-10-16 03:03:25,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905369154] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:25,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:25,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 03:03:25,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377915538] [2021-10-16 03:03:25,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:25,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:25,360 INFO L87 Difference]: Start difference. First operand 1394 states and 1744 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 3 states have internal predecessors, (324), 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-16 03:03:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:28,888 INFO L93 Difference]: Finished difference Result 4037 states and 5067 transitions. [2021-10-16 03:03:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 3 states have internal predecessors, (324), 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 238 [2021-10-16 03:03:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:28,902 INFO L225 Difference]: With dead ends: 4037 [2021-10-16 03:03:28,902 INFO L226 Difference]: Without dead ends: 2784 [2021-10-16 03:03:28,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2021-10-16 03:03:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 1811. [2021-10-16 03:03:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1607734806629835) internal successors, (2101), 1810 states have internal predecessors, (2101), 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-16 03:03:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2101 transitions. [2021-10-16 03:03:28,972 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2101 transitions. Word has length 238 [2021-10-16 03:03:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:28,973 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 2101 transitions. [2021-10-16 03:03:28,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 3 states have internal predecessors, (324), 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-16 03:03:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2101 transitions. [2021-10-16 03:03:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-10-16 03:03:28,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:28,982 INFO L512 BasicCegarLoop]: trace histogram [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, 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-16 03:03:28,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-10-16 03:03:29,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:29,196 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1074675739, now seen corresponding path program 1 times [2021-10-16 03:03:29,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:29,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112248302] [2021-10-16 03:03:29,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:29,199 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:29,200 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:29,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 03:03:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:29,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-16 03:03:29,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 160 proven. 72 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 03:03:31,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 178 proven. 54 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 03:03:34,502 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:34,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112248302] [2021-10-16 03:03:34,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112248302] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:03:34,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [504230004] [2021-10-16 03:03:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:34,504 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 03:03:34,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 03:03:34,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 03:03:34,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-10-16 03:03:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:35,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-16 03:03:35,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 152 proven. 62 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 03:03:38,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 188 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 03:03:41,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [504230004] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:03:41,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456462249] [2021-10-16 03:03:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:41,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:03:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:03:41,198 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 03:03:41,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-16 03:03:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:42,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-16 03:03:42,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 03:03:45,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-16 03:03:47,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456462249] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:47,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2021-10-16 03:03:47,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4, 4, 7, 7] total 20 [2021-10-16 03:03:47,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459863506] [2021-10-16 03:03:47,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 03:03:47,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 03:03:47,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-10-16 03:03:47,435 INFO L87 Difference]: Start difference. First operand 1811 states and 2101 transitions. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 6 states have internal predecessors, (272), 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-16 03:03:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:50,168 INFO L93 Difference]: Finished difference Result 3536 states and 4111 transitions. [2021-10-16 03:03:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 03:03:50,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 6 states have internal predecessors, (272), 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 295 [2021-10-16 03:03:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:50,178 INFO L225 Difference]: With dead ends: 3536 [2021-10-16 03:03:50,179 INFO L226 Difference]: Without dead ends: 1811 [2021-10-16 03:03:50,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1764 GetRequests, 1743 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1009.0ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-10-16 03:03:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2021-10-16 03:03:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2021-10-16 03:03:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1569060773480664) internal successors, (2094), 1810 states have internal predecessors, (2094), 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-16 03:03:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2094 transitions. [2021-10-16 03:03:50,228 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2094 transitions. Word has length 295 [2021-10-16 03:03:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:50,228 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 2094 transitions. [2021-10-16 03:03:50,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 6 states have internal predecessors, (272), 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-16 03:03:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2094 transitions. [2021-10-16 03:03:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-10-16 03:03:50,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:50,236 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-10-16 03:03:50,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:50,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:50,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:50,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:03:50,851 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash -932059071, now seen corresponding path program 1 times [2021-10-16 03:03:50,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:50,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286055060] [2021-10-16 03:03:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:50,854 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:50,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:50,855 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:50,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-16 03:03:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:52,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-16 03:03:52,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 196 proven. 72 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 03:03:53,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:04:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 196 proven. 72 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 03:04:07,668 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:04:07,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286055060] [2021-10-16 03:04:07,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286055060] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:04:07,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [135755271] [2021-10-16 03:04:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:04:07,669 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 03:04:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 03:04:07,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 03:04:07,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-10-16 03:04:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:04:09,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-16 03:04:09,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:04:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 196 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-16 03:04:14,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:04:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 196 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-16 03:04:17,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [135755271] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:04:17,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910243616] [2021-10-16 03:04:17,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:04:17,438 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:04:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:04:17,439 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 03:04:17,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-16 03:04:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:04:19,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-16 03:04:19,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:04:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 186 proven. 17 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-16 03:04:24,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:04:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 186 proven. 17 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-16 03:04:28,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910243616] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:04:28,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-16 03:04:28,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 9, 8, 4, 4] total 19 [2021-10-16 03:04:28,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619940809] [2021-10-16 03:04:28,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-16 03:04:28,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:04:28,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-16 03:04:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-10-16 03:04:28,282 INFO L87 Difference]: Start difference. First operand 1811 states and 2094 transitions. Second operand has 19 states, 19 states have (on average 56.36842105263158) internal successors, (1071), 19 states have internal predecessors, (1071), 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-16 03:07:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:07:56,239 INFO L93 Difference]: Finished difference Result 6076 states and 7029 transitions. [2021-10-16 03:07:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-16 03:07:56,244 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 56.36842105263158) internal successors, (1071), 19 states have internal predecessors, (1071), 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 331 [2021-10-16 03:07:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:07:56,272 INFO L225 Difference]: With dead ends: 6076 [2021-10-16 03:07:56,272 INFO L226 Difference]: Without dead ends: 4406 [2021-10-16 03:07:56,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2035 GetRequests, 1987 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 33772.8ms TimeCoverageRelationStatistics Valid=547, Invalid=1903, Unknown=0, NotChecked=0, Total=2450 [2021-10-16 03:07:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2021-10-16 03:07:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 2645. [2021-10-16 03:07:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1096822995461422) internal successors, (2934), 2644 states have internal predecessors, (2934), 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-16 03:07:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 2934 transitions. [2021-10-16 03:07:56,374 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 2934 transitions. Word has length 331 [2021-10-16 03:07:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:07:56,375 INFO L470 AbstractCegarLoop]: Abstraction has 2645 states and 2934 transitions. [2021-10-16 03:07:56,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 56.36842105263158) internal successors, (1071), 19 states have internal predecessors, (1071), 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-16 03:07:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 2934 transitions. [2021-10-16 03:07:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-10-16 03:07:56,385 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:07:56,385 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:07:56,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-16 03:07:56,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-10-16 03:07:56,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-16 03:07:57,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:07:57,002 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:07:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:07:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1230177848, now seen corresponding path program 1 times [2021-10-16 03:07:57,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:07:57,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297057695] [2021-10-16 03:07:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:07:57,005 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:07:57,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:07:57,008 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:07:57,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-16 03:07:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:07:59,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-16 03:07:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:08:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 26 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:08:07,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:08:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-10-16 03:08:32,686 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:08:32,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297057695] [2021-10-16 03:08:32,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297057695] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:08:32,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 03:08:32,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2021-10-16 03:08:32,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506534990] [2021-10-16 03:08:32,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 03:08:32,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:08:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 03:08:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-16 03:08:32,690 INFO L87 Difference]: Start difference. First operand 2645 states and 2934 transitions. Second operand has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 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-16 03:08:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:08:36,584 INFO L93 Difference]: Finished difference Result 4980 states and 5555 transitions. [2021-10-16 03:08:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 03:08:36,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 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 360 [2021-10-16 03:08:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:08:36,601 INFO L225 Difference]: With dead ends: 4980 [2021-10-16 03:08:36,602 INFO L226 Difference]: Without dead ends: 2754 [2021-10-16 03:08:36,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 833.3ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-16 03:08:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2021-10-16 03:08:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2714. [2021-10-16 03:08:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 1.1032067821599705) internal successors, (2993), 2713 states have internal predecessors, (2993), 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-16 03:08:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 2993 transitions. [2021-10-16 03:08:36,672 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 2993 transitions. Word has length 360 [2021-10-16 03:08:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:08:36,673 INFO L470 AbstractCegarLoop]: Abstraction has 2714 states and 2993 transitions. [2021-10-16 03:08:36,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 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-16 03:08:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 2993 transitions. [2021-10-16 03:08:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2021-10-16 03:08:36,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:08:36,686 INFO L512 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:08:36,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-10-16 03:08:36,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:08:36,901 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:08:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:08:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1472721113, now seen corresponding path program 1 times [2021-10-16 03:08:36,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:08:36,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775039044] [2021-10-16 03:08:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:08:36,904 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:08:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:08:36,906 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:08:36,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-16 03:08:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 03:08:41,027 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 03:08:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 03:08:41,684 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-16 03:08:41,685 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 03:08:41,686 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-16 03:08:41,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-16 03:08:41,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:08:41,903 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 03:08:42,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 03:08:42 BoogieIcfgContainer [2021-10-16 03:08:42,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 03:08:42,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 03:08:42,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 03:08:42,258 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 03:08:42,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:02:37" (3/4) ... [2021-10-16 03:08:42,262 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 03:08:42,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 03:08:42,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 03:08:42,565 INFO L168 Benchmark]: Toolchain (without parser) took 369431.38 ms. Allocated memory was 69.2 MB in the beginning and 343.9 MB in the end (delta: 274.7 MB). Free memory was 49.5 MB in the beginning and 116.3 MB in the end (delta: -66.8 MB). Peak memory consumption was 207.6 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,565 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 69.2 MB. Free memory was 49.6 MB in the beginning and 49.5 MB in the end (delta: 54.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 03:08:42,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.32 ms. Allocated memory is still 69.2 MB. Free memory was 49.2 MB in the beginning and 32.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.24 ms. Allocated memory is still 69.2 MB. Free memory was 32.5 MB in the beginning and 48.0 MB in the end (delta: -15.5 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,567 INFO L168 Benchmark]: Boogie Preprocessor took 67.34 ms. Allocated memory is still 69.2 MB. Free memory was 48.0 MB in the beginning and 43.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,568 INFO L168 Benchmark]: RCFGBuilder took 3158.15 ms. Allocated memory was 69.2 MB in the beginning and 94.4 MB in the end (delta: 25.2 MB). Free memory was 43.8 MB in the beginning and 61.3 MB in the end (delta: -17.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,568 INFO L168 Benchmark]: TraceAbstraction took 365063.89 ms. Allocated memory was 94.4 MB in the beginning and 343.9 MB in the end (delta: 249.6 MB). Free memory was 61.3 MB in the beginning and 161.4 MB in the end (delta: -100.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,569 INFO L168 Benchmark]: Witness Printer took 305.77 ms. Allocated memory is still 343.9 MB. Free memory was 161.4 MB in the beginning and 116.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:42,571 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 69.2 MB. Free memory was 49.6 MB in the beginning and 49.5 MB in the end (delta: 54.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 724.32 ms. Allocated memory is still 69.2 MB. Free memory was 49.2 MB in the beginning and 32.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 97.24 ms. Allocated memory is still 69.2 MB. Free memory was 32.5 MB in the beginning and 48.0 MB in the end (delta: -15.5 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.34 ms. Allocated memory is still 69.2 MB. Free memory was 48.0 MB in the beginning and 43.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3158.15 ms. Allocated memory was 69.2 MB in the beginning and 94.4 MB in the end (delta: 25.2 MB). Free memory was 43.8 MB in the beginning and 61.3 MB in the end (delta: -17.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 365063.89 ms. Allocated memory was 94.4 MB in the beginning and 343.9 MB in the end (delta: 249.6 MB). Free memory was 61.3 MB in the beginning and 161.4 MB in the end (delta: -100.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 16.1 GB. * Witness Printer took 305.77 ms. Allocated memory is still 343.9 MB. Free memory was 161.4 MB in the beginning and 116.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.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: 41]: 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 TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L537] a1 = (((a1 * 5) + 278443) - -239546) [L538] return 26; VAL [a1=518104, a10=0, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, 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=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND TRUE (((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)) [L346] a1 = ((((((a1 / 5) % 25)+ 13) * 5) % 25)- -12) [L347] a10 = 4 [L349] return 22; VAL [a1=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, 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=27, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) VAL [a1=27, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) VAL [a1=27, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L558] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) VAL [a1=27, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L564] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) VAL [a1=27, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14)))) VAL [a1=27, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L573] COND TRUE ((a4==14) && ((((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a12==0)) && (a19==9)) && (a10==4))) [L574] a1 = (((a1 + 566454) + 1842) + 23814) [L575] a10 = 2 [L576] a19 = 8 [L578] return -1; VAL [a1=592137, a10=2, 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=592137, a10=2, 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=592137, a10=2, 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=592137, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND TRUE (((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=592137, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] reach_error() VAL [a1=592137, a10=2, 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: 364622.8ms, OverallIterations: 10, TraceHistogramMax: 4, EmptinessCheckTime: 101.6ms, AutomataDifference: 249492.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 452 SDtfs, 3079 SDslu, 196 SDs, 0 SdLazy, 10467 SolverSat, 2167 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 200368.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6375 GetRequests, 6273 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 36179.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2714occurred in iteration=9, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 522.1ms AutomataMinimizationTime, 9 MinimizatonAttempts, 3747 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 280.7ms SsaConstructionTime, 1723.5ms SatisfiabilityAnalysisTime, 91990.5ms InterpolantComputationTime, 3543 NumberOfCodeBlocks, 3543 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6320 ConstructedInterpolants, 0 QuantifiedInterpolants, 55037 SizeOfPredicates, 49 NumberOfNonLiveVariables, 3990 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 3538/4410 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-16 03:08:42,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e62a427-d2b0-489c-871e-6a8ab25f3748/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...